Chromatic number $\chi(\mathbb{R}^{4})$

The fewest colors needed to color the points of $\mathbb{R}^{4}$ so that no two points at distance exactly 1 have the same color.

Lower bound: $11$ Literature
Upper bound: $43$ Literature

History

Each bound that improved on the earlier ones, with the record of its discovery and its best evidence. A bound is discovered in the literature, or by a certificate submitted here. Its best evidence is a certificate checked here, if there is one at least as strong: a formal proof in Lean (Lean proof) or an explicit construction checked by a program (Checked construction). Otherwise it's an Attested certificate, which someone else checked with a published checker, or the Literature. Submit a certificate.

Date Bound Discovery Best evidence
1968-12-10 $\ge 6$ D. E. Raiskii, Realization of all distances in a decomposition of the space R^n into n+1 parts, Matematicheskie Zametki 7 (1970) 319-323; Mathematical Notes 7 (1970) 194-196.
[via M. S. Payne and D. Coulson, A dense distance 1 excluding set in R^3, Gazette of the Australian Mathematical Society 34 (2007) 97-102.]
Literature
1996-02 $\ge 7$ K. Cantwell, Finite Euclidean Ramsey theory, Journal of Combinatorial Theory, Series A 73 (1996) 273-285.
[via G. Exoo, D. Ismailescu and M. Lim, On the chromatic number of R^4, Discrete & Computational Geometry 52 (2014) 416-423.]
Literature
2003 $\le 54$ R. Radoičić and G. Tóth, Note on the chromatic number of the space, in: Discrete and Computational Geometry: The Goodman-Pollack Festschrift, Algorithms and Combinatorics 25, Springer (2003) 695-698.
[via A. Arman, A. Bondarenko, A. Prymak and D. Radchenko, Upper bounds on chromatic number of E^n in low dimensions, Electronic Journal of Combinatorics 31(2) (2024) #P2.35, arXiv:2112.13438.]
Literature
2007-05 $\le 49$ M. S. Payne and D. Coulson, A dense distance 1 excluding set in R^3, Gazette of the Australian Mathematical Society 34 (2007) 97-102.
[via A. Arman, A. Bondarenko, A. Prymak and D. Radchenko, Upper bounds on chromatic number of E^n in low dimensions, Electronic Journal of Combinatorics 31(2) (2024) #P2.35, arXiv:2112.13438.]
Literature
2014-08-09 $\ge 9$ G. Exoo, D. Ismailescu and M. Lim, On the chromatic number of R^4, Discrete & Computational Geometry 52 (2014) 416-423. Literature
2026-09-17 $\le 43$ L. L. Ivanov and N. V. Glushkova, New upper bounds for the chromatic numbers of Euclidean spaces, arXiv:2609.20436 (2026). Literature
2026-10-08 $\ge 11$ J. Davies, Measurable obstructions for unmeasurable colourings, arXiv:2610.12301 (2026). Literature