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, Ω(log n). This settles a problem of McDiarmid, Mitsche, and Prałat who proved that it is O(log n) with high probability.
| Original language | English |
|---|---|
| Pages (from-to) | 428-433 |
| Number of pages | 6 |
| Journal | Journal of Graph Theory |
| Volume | 88 |
| Issue number | 3 |
| DOIs | |
| State | Published - Jul 2018 |
Keywords
- cliques
- coloring
- random graphs
All Science Journal Classification (ASJC) codes
- Geometry and Topology