On Coloring the Odd-Distance Graph
Abstract
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
0
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.