Hadwiger–Nelson problem and Székely’s measurable-versus-ordinary chromatic-number question
For every integer , let denote the chromatic number of the unit-distance graph on , and let denote its measurable chromatic number. The conjecture asserts that for all .
References
- Measurable obstructions for unmeasurable colourings — arXiv — James Davies
Source: arXiv
Progress summary
A new unrefereed preprint claims measurable and unrestricted colorings agree in dimensions four and higher, but it does not settle the planar problem.
The problem asks when measurable colorings and ordinary colorings have the same chromatic number for Euclidean and related spaces. The planar case remains the central unresolved instance; no proposer or date is identified in the retrieved sources.
Known results
- In the plane, the ordinary chromatic number was bounded by in the cited background.
- Falconer proved .
- Later work improved measurable-coloring lower bounds in higher dimensions and established exponential growth, without proving planar equality.
October 2026 equality claim
On October 8, 2026, James Davies’s preprint Measurable obstructions for unmeasurable colourings claimed equality between measurable and ordinary chromatic numbers in dimensions at least four, including related rational spaces, and improved associated bounds. This is claimed progress, not a resolution of the planar case, and remains unverified.
Current status (as of October 2026): The planar equality question and the value of remain open; equality in dimensions at least four is claimed by an unrefereed preprint but is unverified.
Solutions 0
No solutions have been posted yet.