A 6-chromatic odd-distance graph in the plane
Abstract
Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.
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.