Erdős Problem a Daythe open tracker

Erdős Problem #118

DISPROVEDdatabase updated 2025-08-31

The statement as posed is false.

What the community database records, not our verdict. erdosproblems.com no longer shows statuses (why).

Local copy of the binary ordinal Ramsey predicate \(\alpha \to (\beta, \gamma)^2\): every 2-coloring of pairs from \(\alpha\) admits a red clique of order type \(\beta\) or a blue clique of order type \(\gamma\). Will be replaced by `OrdinalRamsey` from `FormalConjecturesForMathlib/SetTheory/Ordinal/ PartitionRelation.lean` once that lands (see PR #4195).

**Erdős Problem 118** (problem of Erdős and Hajnal). Let \(\alpha\) be such that \(\alpha \to (\alpha, 3)^2\). For every \(n \ge 3\), must \(\alpha \to (\alpha, n)^2\)? The original question is asked for cardinals, ordinals, and order types; we state the ordinal version, which is the standard reading: ordinals \(\alpha\) with \(\alpha \to (\alpha, 3)^2\) are called *partition ordinals*. The answer is **no**, shown independently by Schipperus [Sc99, Sc10] and Darby [Da99]. Larson [La00] gave the concrete counterexample \(\alpha = \omega^{\omega^2}\), for which \(\alpha \to (\alpha, 3)^2\) holds yet \(\alpha \not\to (\alpha, 5)^2\). See Chapter 2.9 of [HST10] for further background.
Statement as formalized in Formal Conjectures (Google DeepMind, Apache-2.0) · their label: research solved · 1 further variant / known partial result in the Lean file. The authoritative wording is on erdosproblems.com/118.
Prizenone
Topicsset theory, ramsey theory
Statement in LeanFormal Conjectures
Solution in Leanno
Original pageerdosproblems.com/118
NOBODY HAS SENT US AN ATTEMPT YET

If you take a run at this one — with your own AI subscription or without — the guide says how, and the submission form gets you an honest read of what you found.