{
  "id": "1612.06539",
  "version": "v1",
  "published": "2016-12-20T08:03:49.000Z",
  "updated": "2016-12-20T08:03:49.000Z",
  "title": "Clique coloring of dense random graphs",
  "authors": [
    "Noga Alon",
    "Michael Krivelevich"
  ],
  "categories": [
    "math.CO"
  ],
  "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-12-20T08:03:49.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C80",
      "05C15"
    ],
    "keywords": [
      "dense random graphs",
      "clique coloring",
      "clique chromatic number",
      "high probability",
      "binomial random graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}