Clique coloring of dense random graphs
Combinatorics
2017-11-07 v2
Abstract
The clique chromatic number of a graph G=(V,E) is the minimum number of colors in a vertex coloring so that no maximal (with respect to containment) clique is monochromatic. We prove that the clique chromatic number of the binomial random graph G=G(n,1/2) is, with high probability, \Omega(log n). This settles a problem of McDiarmid, Mitsche and Pralat who proved that it is O(log n) with high probability.
Cite
@article{arxiv.1612.06539,
title = {Clique coloring of dense random graphs},
author = {Noga Alon and Michael Krivelevich},
journal= {arXiv preprint arXiv:1612.06539},
year = {2017}
}