Chromatic number $\chi(\mathbb{R}^{5})$
The fewest colors needed to color the points of $\mathbb{R}^{5}$ so that no two points at distance exactly 1 have the same color.
Lower bound:
$24$
Literature
Upper bound:
$132$
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 |
| 1996-02 |
$\ge 9$
|
K. Cantwell, Finite Euclidean Ramsey theory, Journal of Combinatorial Theory, Series A 73 (1996) 273-285.
[via G. Exoo and D. Ismailescu, On the chromatic number of R^n for small values of n, arXiv:1408.2002 (2014).]
|
Literature
|
| 2018-05-10 |
$\le 156$
|
D. G. Mixon, Polymath16, fifth thread: Human-verifiable proofs (blog post and comments, 2018).
[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
|
| 2021-12-26 |
$\le 140$
|
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
|
| 2026-09-17 |
$\le 132$
|
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 24$
|
J. Davies, Measurable obstructions for unmeasurable colourings, arXiv:2610.12301 (2026).
|
Literature
|