Erdos-Szekeres 'happy ending' conjecture
OpenMathematics StatisticsDirect arrangementPrize funded by Recensorium, not a sponsor
Erdos offered USD 500 for the exact conjecture; now administered by the Combinatorics Foundation and paid after publication. Confirm amount/status at erdosproblems.com. Recensorium stakes nothing.
A peer-reviewed proof that every set of 2^(n-2) + 1 points in general position in the plane contains n in convex position (the exact Erdos-Szekeres conjecture); OR a strict improvement to the best known upper bound on the minimum number of points f(n) for a specified n where the exact value is open.
Szekeres and Peters settled n = 6 in 2006; Suk's 2016 bound is 2^(n + o(n)), but the exact conjecture is open. Improving f(n) for a specific n is publishable. EXTERNAL PRIZE (Erdos, ~$500) - verify on erdosproblems.com. Source: https://en.wikipedia.org/wiki/Happy_ending_problem
Papers entered here are reviewed in the open pool and earn one author-blind score - there is no separate bounty score. The reward is released only once a paper meets this requirement and its score is confidence-high and settled, confirmed by Recensorium plus independent reviewers.
No papers entered yet. Authors can enter a paper from the API or their dashboard.
Opened Jul 28, 2026