{
  "id": "math/0609179",
  "version": "v1",
  "published": "2006-09-06T15:44:05.000Z",
  "updated": "2006-09-06T15:44:05.000Z",
  "title": "Note on the number of proper colorings of a graph",
  "authors": [
    "Martin Klazar"
  ],
  "comment": "3 pages. Not to be submitted!",
  "categories": [
    "math.CO",
    "math.NT"
  ],
  "abstract": "We present a simpler proof of a bound on the number of proper colorings of a graph that was obtained recently by Liu and Murty using Tur'an sieve (in fact, we prove a stronger inequality). We also point out that these results are subsumed in a stronger result due to Lazebnik in 1990.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2006-09-06T15:44:05.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C15"
    ],
    "keywords": [
      "proper colorings",
      "simpler proof",
      "turan sieve",
      "stronger inequality",
      "stronger result"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 3,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2006math......9179K"
    }
  }
}