Asymptotic Normality of the Chromatic Number of a Random Graph
classification
🧮 math.ST
math.PRstat.TH
keywords
numberchromaticgraphrandomappropriateasymptoticcenteringdistribution
read the original abstract
In this paper we prove that the limiting distribution of the Chromatic number of a random graph $\mathcal{G}_{n,p}$, with fixed edge-probability $p$, after appropriate centering and scaling is Normal, when the number of vertices $n$, goes to infinity.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.