Skip to content

Erdős Problem #107

Editorial depth: Reviewed explanatory article — evidence qualified.
Snapshot classification: falsifiable (not automatically the live result).
Subject areas: geometry, convex.

Read this status correctly

The status above is reproduced from GCL's immutable external-catalogue snapshot. It is not a new claim of current mathematical resolution, a source-semantic review, an independent proof check, or GCL certification. A published proof and a GCL replay are separate events.

The question in plain language

Place \(N\) points in the Euclidean plane, with no three collinear. How large must \(N\) be to guarantee that some \(n\) of the points form the vertices of a strictly convex \(n\) gon, in some order? Write \(f(n)\) for the minimum such number.

Erdős #107, the Erdős–Szekeres Happy Ending problem, conjectures

\[ f(n)=2^{n-2}+1 \]

for every \(n\ge3\). The extremal configuration may have no three collinear but still contain many points in the interior of its convex hull.

A small example

Four points in general position need not make a convex quadrilateral: one can lie strictly inside the triangle formed by the other three. But Klein observed that any five points with no three collinear contain four in convex position. Hence \(f(4)=5=2^{4-2}+1\).

The five-point theorem is a finite geometric result, not a proof of the conjecture for arbitrarily large \(n\). Similarly, the sharp value \(f(5)=9\) established by Makai and Turán supplies one more case, not a general construction.

What is known

The exact conjecture is OPEN. Erdős and Szekeres established the classic estimates

\[ 2^{n-2}+1\le f(n)\le\binom{2n-4}{n-2}+1. \]

The left inequality comes from arrangements avoiding a large convex polygon; the right from their order-type combinatorial argument. Suk's 2017 work substantially improved the upper growth rate to \(2^{n+o(n)}\). The maintained Erdős #107 attributes the strongest recorded upper bound to Holmsen, Mojarrad, Pach and Tardos:

\[ f(n)\le2^{n+O(\sqrt{n\log n})}. \]

The primary 2020 publisher source Two extensions of the Erdős–Szekeres problem was checked for its authors and scope. Its main abstract treats extensions to convex bodies, rather than serving as an independent verification of every constant in the point-set estimate cited by the catalogue. Those two settings must not be conflated.

The maintained entry labels #107 FALSIFIABLE because a finite counterexample to the exact equality would refute it, even though proving the equality for all \(n\) would require more than finite enumeration.

GCL's current state

The pinned registry and maintained page, last edited April 2026, both mark #107 falsifiable/open. The original source task is #1376. No full proof of the upper estimate, exhaustive verification of \(f(5)=9\), or new extremal value is certified by this editorial audit.

The original issue contains an authenticated RESULT/1 source report. This is unadjudicated source evidence only, not independent mathematical certification or editorial admission.

What remains

A bounded check is to formalize the five-point quadrilateral theorem using orientation signs of triples, and verify explicit four-point configurations with one interior point. Acceptance: in every realizable order type of five noncollinear points, a four-point subset has each vertex on its convex hull. Ensure configurations with collinear triples are rejected. Stop at this exact finite statement without extrapolating an infinite formula.

Sources and claim boundaries

No solution of the Happy Ending conjecture, exact upper-bound theorem replay or editorial admission is claimed.

Catalogue and evidence provenance

  • Pinned catalogue source: teorth/erdosproblems at 536408716724.
  • GCL issue: #1376 — protected issue/assignment identity; its labels and results are live, not reproduced automatically here.
  • GCL triage: OUTSIDE_STRICT_OPEN_TRIAGE.
  • Formal-statement coverage: A provider statement was included in the pinned snapshot. Presence does not mean the statement or proof has been checked.
  • External mathematical status: consult current problem page and its dated bibliography.

Back to catalogue · Compendium introduction