Department of Mathematics Calendar

Back to Listing

The Department of Mathematics Calendar has moved to Webtools. Anyone may submit an event by clicking the "+" button (upper right). Note: the Sponsor field is required. Just type "n/a"

All events will be reviewed before acceptance. Please email Shelby Koehne if you have any questions about submitting an event.

Note: you may search past and future events by clicking on the magnifying glass icon on the main Calendar page.

For an archive of past events:

Special Colloquium/Candidate Presentation: A proof of the Erdős–Faber–Lovász conjecture and related problems

Event Type
wifi event
Jan 25, 2022   11:00 am  
Abhishek Methuku
Alexandr Kostochka

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: 

Meeting ID: 793 864 7305 

Passcode: 588788

link for robots only