The two possible values of the chromatic number of a random graph
Probability
2007-06-13 v1
Abstract
Given d \in (0,infty) let k_d be the smallest integer k such that d < 2k\log k. We prove that the chromatic number of a random graph G(n,d/n) is either k_d or k_d+1 almost surely.
Cite
@article{arxiv.0706.1725,
title = {The two possible values of the chromatic number of a random graph},
author = {Dimitris Achlioptas and Assaf Naor},
journal= {arXiv preprint arXiv:0706.1725},
year = {2007}
}
Comments
17 pages, published version