Chromatic number $\chi(\mathbb{R}^{9})$
The fewest colors needed to color the points of $\mathbb{R}^{9}$ so that no two points at distance exactly 1 have the same color.
Lower bound:
$357$
Literature
Upper bound:
$7203$
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 |
| 2008 |
$\ge 21$
|
A. B. Kupavskii and A. M. Raigorodskii, On the chromatic number of R^9, Fundamentalnaya i Prikladnaya Matematika 14 (2008) 139-154; Journal of Mathematical Sciences 163 (2009) 720-731.
[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 22$
|
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 17253$
(17,253)
|
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-07-06 |
$\ge 30$
|
J. Parts, comment of 2026-07-06 on D. G. Mixon, Polymath16, eighteenth thread: Back with a new conjecture! (blog post, 2026).
[via J. Davies, Measurable obstructions for unmeasurable colourings, arXiv:2610.12301 (2026).]
|
Literature
|
| 2026-09-17 |
$\le 7203$
|
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 357$
|
J. Davies, Measurable obstructions for unmeasurable colourings, arXiv:2610.12301 (2026).
|
Literature
|