On the chromatic number of random regular graphs
Abstract
Let G(n,d) be the random d-regular graph on n vertices. For any integer k exceeding a certain constant k0 we identify a number dk-col such that G(n,d) is k-colorable w.h.p. if d<dk-col and non-k-colorable w.h.p. if d>dk-col.
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.