Asymptotic Normality of the Chromatic Number of a Random Graph
Abstract
In this paper we prove that the limiting distribution of the Chromatic number of a random graph Gn,p, with fixed edge-probability p, after appropriate centering and scaling is Normal, when the number of vertices n, goes to infinity.
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.