AlphaEvolve problems·alphaevolve:58
Erdős--Szekeres Happy Ending problem
No formal proof attached. Any claim here rests on a write-up or a report.
Fidelity F0: Absent. No formal statement is attached to the result.
For $k \\geq 3$, let $C(k)$ be the smallest integer such that every set of $C(k)$ points in the plane in general position contains a convex $k$-gon. Obtain upper and lower bounds for $C(k)$ that are as strong as possible.
AI activity
How grades workReasoning and sources
Autonomy
An evolutionary coding agent searching against an evaluator written by people, who also chose the problems.
Fidelity
How fidelity is gradedF0 no formal statement. Absent. No formal statement is attached to the result.
Follow and discuss
All discussionFollow this problem
An email when it has a new claim, check, bounty or discussion. You confirm once and can stop with one click.
Discussion and bounties for this problem load here.
Seen recently
What the monitors picked up in the last thirty days, not yet graded.
Something wrong or missing here? Request a correction or add a claim, with its sources.
Claims and corrections from readers
All of themSources
Cite this record
qed.bot, “Erdős--Szekeres Happy Ending problem”, https://qed.bot/t/alphaevolve-58, as of 30 Sep 2026.