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

- Series
- School of Mathematics Colloquium
- Time
- Thursday, May 6, 2021 - 11:00 for 1 hour (actually 50 minutes)
- Location
- https://us02web.zoom.us/j/87011170680?pwd=ektPOWtkN1U0TW5ETFcrVDNTL1V1QT09
- Speaker
- Tom Kelly – University of Birmingham – T.J.Kelly@bham.ac.uk

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$. In joint work with Dong Yeap Kang, Daniela Kühn, Abhishek Methuku, and Deryk Osthus, we proved this conjecture for every sufficiently large $n$. In this talk, I will present the history of this conjecture and sketch our proof in a special case.