Dong Yeap Kang, Tom Kelly, Daniela Kühn, Abhishek Methuku, Deryk Osthus
Published 2021-06-25Version 1
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.
Comments: to appear in the proceedings of the 8th European Congress of Mathematics; 31 pages, 2 figures
The conjecture cr(C_m\times C_n)=(m-2)n is true for all but finitely many n, for each m
On a conjecture of Widom
New results related to a conjecture of Manickam and Singhi
![QR code for arXiv:2106.13733 [math.CO]](http://oss.arxitics.com/images/favicon.svg)