Chromatic number $\chi(\mathbb{R}^{3})$
The fewest colors needed to color the points of $\mathbb{R}^{3}$ so that no two points at distance exactly 1 have the same color.
Lower bound:
$7$
Literature
Upper bound:
$15$
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 5$
|
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 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.]
|
Literature
|
| 1989-05 |
$\le 21$
|
L. A. Székely and N. C. Wormald, Bounds on the measurable chromatic number of R^n, Discrete Mathematics 75 (1989) 343-372.
[via 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.]
|
Literature
|
| 1997-06 |
$\le 18$
|
D. Coulson, An 18-colouring of 3-space omitting distance one, Discrete Mathematics 170 (1997) 241-247.
|
Literature
|
| 2002-09 |
$\ge 6$
|
O. Nechushtan, On the space chromatic number, Discrete Mathematics 256 (2002) 499-507.
[via G. Exoo and D. Ismailescu, On the chromatic number of R^n for small values of n, arXiv:1408.2002 (2014).]
|
Literature
|
| 2002-09 |
$\le 15$
|
D. Coulson, A 15-colouring of 3-space omitting distance one, Discrete Mathematics 256 (2002) 83-90.
[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
|
| 2026-10-11 |
$\ge 7$
|
M. Koshelev, A. Kupavskii and V. Voronov, Ordinary and measurable colorings of Euclidean three-space, arXiv:2610.18907 (2026).
|
Literature
|