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.

翻译：本文对图表和高频颜色中的方法、结果和公开问题进行了调查,特别强调了半随机的“咬咬”方法。我们还详细概述了最近Erd\H{o}s-Faber-Lov\'{a}sz猜想证据的某些方面。