The chromatic number χ(G) of a graph G is defined as the minimum number of colours required for a vertex colouring where no two adjacent vertices are coloured the same. The chromatic number of the dense random graph G∼G(n,p) where p∈(0,1)
Nearby in the stack
is constant has been intensively studied since the 1970s, and a landmark result by Bollobás in 1987 first established the asymptotic value of
χ(G)
. Despite several improvements of this result, the exact value of
χ(G)
remains open. In this paper, new upper and lower bounds for
χ(G)
are established. These bounds are the first ones that match each other up to a term of size
o(1)
in the denominator: they narrow down the colouring rate