Events by date

Title: A proof of the Erdős–Faber–Lovász conjecture

Speaker: Tom Kelly Affliliation: University of Birmingham Zoom: Contact Emma Watson

Abstract:

The Erdős–Faber–Lovász conjecture (posed in 1972) states that the chromatic index of any linear hypergraph on $n$ vertices is at most $n$.  We prove this conjecture for every sufficiently large $n$.  This is joint work with Dong Yeap Kang, Daniela Kühn, Abhishek Methuku, and Deryk Osthus.