A new proof of the Larman-Rogers upper bound for the chromatic number of the Euclidean space

Roman Prosanov

The chromatic number $\chi ({\mathbb{R}}^n)$ of the Euclidean space ${\mathbb{R}}^n$ is the smallest number of colors sufficient for coloring all points of the space in such a way that any…