A proof of the Erdos-Faber-Lovasz conjecture

Graph and hypergraph colouring problems are central to combinatorics, with applications and connections to many other areas, such as geometry, algorithm design, and information theory. However, for