The surface of a sufficiently large sphere has chromatic number at most 7
Abstract
We present a method to assign, for any radius r greater than about 12.44, one of seven colors to each point in R3 lying at distance r from the origin, such that no two points at unit distance from each other are assigned the same color. The existence of such a construction contrasts with the recent demonstration that, for any positive value , if no two points assigned the same color lie at any distance in [1,1+] (and with certain other restrictions that are also satisfied with our coloring), then eight colors are needed for any finite r18, even though seven colors suffice in the plane when ≤72 - 1.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.