Graph and hypergraph colouring via nibble methods: A survey

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.