@article{c55cc6ee31fe4c83848feddb10bde7dc,

title = "The concentration of the chromatic number of random graphs",

abstract = "We prove that for every constant δ > 0 the chromatic number of the random graph G(n,p) with p = n-1/2-δ is asymptotically almost surely concentrated in two consecutive values. This implies that for any β < 1/2 and any integer valued function r(n)≤O(nβ) there exists a function p(n) such that the chromatic number of G(n,p(n)) is precisely r(n) asymptotically almost surely.",

author = "Noga Alon and Michael Krivelevich",

note = "Funding Information: Mathematics Subject Classification (1991): 05C80, 05C15 * Research supported in part by a USA Israeli BSF grant and by a grant from the Israel Science Foundation. t Research supported in part by a Charles Clore Fellowship.",

year = "1997",

doi = "10.1007/BF01215914",

language = "אנגלית",

volume = "17",

pages = "303--313",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "3",

}