Accepted Manuscript Page 1 Annika Heckel Non-concentration of the chromatic number of a
random graph Journal of the American Mathematical Society DOI: 10.1090/jams/957 Accepted …

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 …

Let 0< p< 1 be fixed. Shamir and Spencer proved in the 1980s that the chromatic number of
a random graph in G (n, p) is concentrated in an interval of length about n^{1/2}. In this …

2), in many respects, the random graphs Gn, m and Gn, p are practically
indistinguishable.(See [4] for an introduction to random graphs.) When in the late 1950s and …

Remark. Actually, Fact 1 as stated above does not appear in the paper of Shamir and
Spencer who use an analogous but more complicated result. Here we follow a suggestion of …

Let χ (G (n, p)) denote the chromatic number of the random graph G (n, p). We prove that
there exists a constant d 0 such that for np (n)> d 0, p (n)→ 0, the probability that np 2 log …

The chromatic number of random graphs Page 1 COMBINATORI Akad~miai Kiad6 -- $pringcr-Verlag
THE CoMBn~A'roRxcA 8 (I) (1988) 49--55 CHROMATIC NUMBER OF RANDOM GRAPHS B …

On the chromatic number of random graphs Page 1 On the Chromatic Number of Random Graphs
Colin McDiarmid Department of Statistics, University of Oxford, Oxford, England ABSTRACT …

The chromatic number χ (G) χ(G) of a graph GG is a fundamental parameter, whose study
was originally motivated by applications (χ (G) χ(G) is the minimum number of internally …

The achromatic number ψ (G) of a graph G is the greatest number of colours in a proper
colouring of the vertices of G such that for every pair of colours some vertex of the first colour …