Happy ending problem (Erdős–Szekeres conjecture)
Does every set of 2^(n−2) + 1 points in the plane, no three on a line, contain n points that form a convex polygon?
Summary
Paul Erdős named the problem after the marriage of George Szekeres and Esther Klein, who discussed it early in their relationship. Erdős and Szekeres conjectured this exact count from the cases n = 3, 4 and 5 and showed it cannot be lowered; in 2016 Andrew Suk proved that 2^(n + o(n)) points suffice.
Source
Open, as listed by Wikipedia · Unsolved problems in mathematics. Checked 18 Nov 2026.
The status is the source’s. Papex does not decide whether a problem is solved.
Records on this problem
No public record addresses this problem yet.