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

- Series
- Graph Theory Seminar
- Time
- Tuesday, December 14, 2021 - 11:00 for 1 hour (actually 50 minutes)
- Location
- ONLINE
- Speaker
- Abhishek Methuku – University of Birmingham – abhishekmethuku@gmail.com

**Please Note:** Note the unusual time!

The famous 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 briefly sketch a proof of this conjecture for every large n. If time permits, I will also talk about our solution to a problem of Erdős from 1977 about chromatic index of hypergraphs with bounded codegree. Joint work with D. Kang, T. Kelly, D.Kuhn and D. Osthus.