The clique‐chromatic number of a graph is the minimum number of colors required to assign to its vertex set so that no inclusion maximal clique is monochromatic. McDiarmid, Mitsche, and Prałat proved that the clique‐chromatic number of the binomial random graph
is at most
with high probability...