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

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

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 this talk, I will sketch a proof of this conjecture for every large n. Joint work with D.Kang, T. Kelly, D. Kühn and D. Osthus.