The two possible values of the chromatic number of a random graph
Abstract
Given d ∈ (0,infty) let kd be the smallest integer k such that d < 2k k. We prove that the chromatic number of a random graph G(n,d/n) is either kd or kd+1 almost surely.
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.