Chromatic number $\chi(\mathbb{R}^{2})$
The fewest colors needed to color the points of $\mathbb{R}^{2}$ so that no two points at distance exactly 1 have the same color.
Lower bound:
$6$
Attested
Upper bound:
$7$
Attested
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 |
| 1950-11 |
$\le 7$
|
J. R. Isbell, unpublished (1950), a 7-coloring of the plane by regular hexagons, reported in A. Soifer, The Mathematical Coloring Book, Springer (2009).
[via A. Soifer, The Mathematical Coloring Book: Mathematics of Coloring and the Colorful Life of its Creators, Springer (2009).]
|
Attested
Certificate chromatic-number-space-2-upper-7,
submitted by daniel-munro, 2026-11-14
[Lean proof checked by punk01-shaka (independent audit of OpenAI's proofs) with their checker, not here]
[proof from J. R. Isbell, unpublished (1950), a 7-coloring of the plane by regular hexagons, reported in A. Soifer, The Mathematical Coloring Book, Springer (2009).]
|
| 1961-05 |
$\ge 4$
|
L. Moser and W. Moser, Solution to Problem 10, Canadian Mathematical Bulletin 4 (1961) 187-189.
[via A. D. N. J. de Grey, The chromatic number of the plane is at least 5, Geombinatorics 28 (2018), arXiv:1804.02385.]
|
Attested
via $\ge 6$, chromatic-number-space-2-lower-6
|
| 2018-04-08 |
$\ge 5$
|
A. D. N. J. de Grey, The chromatic number of the plane is at least 5, Geombinatorics 28 (2018), arXiv:1804.02385.
|
Attested
via $\ge 6$, chromatic-number-space-2-lower-6
|
| 2026-10-06 |
$\ge 6$
|
OpenAI, The Euclidean plane is not five-colorable, preprint dated September 23, 2026, in the openai/math repository on GitHub.
|
Attested
Certificate chromatic-number-space-2-lower-6,
submitted by daniel-munro, 2026-11-14
[Lean proof checked by punk01-shaka (independent audit of OpenAI's proof) with their checker, not here]
[proof from OpenAI, The Euclidean plane is not five-colorable, preprint dated September 23, 2026, in the openai/math repository on GitHub.]
|