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

Abstract: The celebrated 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.

History of the problem: Erdős problems, UCSD.

Joint work with D. Kang, T. Kelly, D.Kuhn and D. Osthus.

combinatoricsprobability

Audience: researchers in the topic

( paper )

---

Extremal and probabilistic combinatorics webinar

Series comments: We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).

---