Abhishek Methuku: 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. 

 

A brief history of the problem:  http://www.math.ucsd.edu/~erdosproblems/erdos/newproblems/ErdosFaberLovasz.html

 

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

 

Zoom link: https://zoom.us/j/2961946869