Asymptotic Normality of the Chromatic Number of a Random Graph

preprint2015arXivOpen access

Abstract

In this paper we prove that the limiting distribution of the Chromatic number of a random graph Gn,p\mathcal{G}_{n,p}, with fixed edge-probability pp, after appropriate centering and scaling is Normal, when the number of vertices nn, goes to infinity.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.