{
  "id": "2111.06214",
  "version": "v1",
  "published": "2021-11-11T14:09:42.000Z",
  "updated": "2021-11-11T14:09:42.000Z",
  "title": "A simplified proof of the Johansson-Molloy Theorem using the Rosenfeld counting method",
  "authors": [
    "Anders Martinsson"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "We show that any triangle-free graph with maximum degree $\\Delta$ has chromatic number at most $\\left(1+o(1)\\right)\\Delta/\\log \\Delta.$",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-11-11T14:09:42.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "rosenfeld counting method",
      "johansson-molloy theorem",
      "simplified proof",
      "chromatic number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}