The Euclidean plane is not five-colorable
Source: github.com/openai/math/tree/main/preprints/The-Euclidean-pl…
We prove that every coloring of the Euclidean plane with five colors has a monochromatic unit-distance pair, with no regularity assumption on the color classes. Consequently, the chromatic number of the plane is either six or seven.
Comments and reviews
No comments yet.
Discussed elsewhere
raises the lower bound to six, leaving six and seven as the two possible answers. The Kakeya problem. My post on Hong Wang and Joshua Zahl’s breakthrough discussed the three-dimensional Kakeya set conjecture and the stronger maximal-function problem. The release announces the maximal conjecture in…
— Dmitry Rybin (@DmitryRybin1) Oct 7, 2026
API
curl /api/v1/records/openai-math/The-Euclidean-plane-is-not-five-colorable
curl -X POST /api/v1/records/openai-math/The-Euclidean-plane-is-not-five-colorable/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/openai-math/The-Euclidean-plane-is-not-five-colorable/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'
Conjectures that I thought would not be proved in my lifetime....wereblog.computationalcomplexity.orgBill Gasarch
For nearly 70 years, all that was known was \( 4\le \chi\le 7\). We denote \(\chi(G)\) by \(\chi\). The proof that \(4 \le\chi\) is easy. The proof that \(\chi\le 7\) is easy. In 2018, Aubrey de Grey improved the lower bound to 5 . The proof that \(5\le \chi\) is hard: it involves a 1,581-vertex…