Abstract: The famous Erdős—Faber—Lovász conjecture states that the chromatic index of any linear hypergraph on n vertices is at most n. This long-standing conjecture was posed 50 years ago and Erdős considered it to be one of his favorite open problems. 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 another problem of Erdős from 1977 about the chromatic index of hypergraphs with bounded codegree. Joint work with D. Kang, T. Kelly, D. Kühn and D. Osthus.
Zoom link:
https://illinois.zoom.us/j/7938647305?pwd=STFhMEZyS1JtWG5udWpSRDZsQmJKUT09
Meeting ID: 793 864 7305
Passcode: 588788
