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 ${\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 been withdrawn by the author due to some error in the proof of theorem

References in corpus (1)

• Increasing the chromatic number of a random graph