Graph and hypergraph colouring via nibble methods: A survey
Combinatorics
2021-11-17 v3 Discrete Mathematics
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.
Keywords
Cite
@article{arxiv.2106.13733,
title = {Graph and hypergraph colouring via nibble methods: A survey},
author = {Dong Yeap Kang and Tom Kelly and Daniela Kühn and Abhishek Methuku and Deryk Osthus},
journal= {arXiv preprint arXiv:2106.13733},
year = {2021}
}
Comments
Final version, to appear in the proceedings of the 8th European Congress of Mathematics; 33 pages, 3 figures