{
  "id": "2106.13733",
  "version": "v1",
  "published": "2021-06-25T16:08:09.000Z",
  "updated": "2021-06-25T16:08:09.000Z",
  "title": "Graph and hypergraph colouring via nibble methods: A survey",
  "authors": [
    "Dong Yeap Kang",
    "Tom Kelly",
    "Daniela Kühn",
    "Abhishek Methuku",
    "Deryk Osthus"
  ],
  "comment": "to appear in the proceedings of the 8th European Congress of Mathematics; 31 pages, 2 figures",
  "categories": [
    "math.CO",
    "cs.DM"
  ],
  "abstract": "This paper provides a survey of methods, results, and open problems on graph and hypergraph colourings, with a particular emphasis on semi-random `nibble' methods. We also give a detailed sketch of some aspects of the recent proof of the Erd\\H{o}s-Faber-Lov\\'{a}sz conjecture.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2021-06-25T16:08:09.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "hypergraph colouring",
      "nibble methods",
      "open problems",
      "conjecture"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 31,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}