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 …
1 event found.