Chromatic number $\chi(\mathbb{R}^{11})$
The fewest colors needed to color the points of $\mathbb{R}^{11}$ so that no two points at distance exactly 1 have the same color.
Lower bound:
$1384$
Literature
Upper bound:
$177147$
(177,147)
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 |
| 2009-09 |
$\ge 23$
|
A. B. Kupavskii and A. M. Raigorodskii, On the chromatic numbers of small-dimensional Euclidean spaces, Electronic Notes in Discrete Mathematics 34 (2009) 435-439 (EuroComb 2009).
[via M. Kahle and B. Taha, New lower bounds on chi(R^d), d = 8, ..., 12, arXiv:1409.1278 (2014).]
|
Literature
|
| 2014-08-09 |
$\ge 26$
|
G. Exoo and D. Ismailescu, On the chromatic number of R^n for small values of n, arXiv:1408.2002 (2014).
|
Literature
|
| 2014-09-03 |
$\ge 32$
|
M. Kahle and B. Taha, New lower bounds on chi(R^d), d = 8, ..., 12, arXiv:1409.1278 (2014).
[via D. Cherkashin, A. Kulikov and A. Raigorodskii, On the chromatic numbers of small-dimensional Euclidean spaces, Discrete Applied Mathematics 243 (2018) 125-131, arXiv:1512.03472.]
|
Literature
|
| 2015-12-10 |
$\ge 35$
|
D. Cherkashin, A. Kulikov and A. Raigorodskii, On the chromatic numbers of small-dimensional Euclidean spaces, Discrete Applied Mathematics 243 (2018) 125-131, arXiv:1512.03472.
|
Literature
|
| 2021-12-26 |
$\le 177147$
(177,147)
|
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-08 |
$\ge 1384$
|
J. Davies, Measurable obstructions for unmeasurable colourings, arXiv:2610.12301 (2026).
|
Literature
|