On lower bounds of the order of k-chromatic unit distance graphs
Abstract
Here we give refined numerical values for the minimum number of vertices of k-chromatic unit distance graphs in the Euclidean 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.