Chromatic number $\chi(\mathbb{R}^{10})$

The fewest colors needed to color the points of $\mathbb{R}^{10}$ so that no two points at distance exactly 1 have the same color.

Lower bound: $729$ Literature
Upper bound: $45619$ (45,619) 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.