On chromatic numbers of some distance graphs
Abstract
In this paper we find chromatic numbers of distance graphs G(n,3,2) for infinitely many n. Also we improve upper bound for (G(n,r,s)) in large part of cases.
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.