Graph and hypergraph colouring via nibble methods: A survey
arXiv:2106.13733
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ős-Faber-Lovász conjecture.
Final version, to appear in the proceedings of the 8th European Congress of Mathematics; 33 pages, 3 figures