BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Abhishek Methuku (University of Birmingham)
DTSTART:20210322T140000Z
DTEND:20210322T150000Z
DTSTAMP:20260423T035536Z
UID:EPC/52
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/52/">A p
 roof of the Erdős–Faber–Lovász conjecture</a>\nby Abhishek Methuku (
 University of Birmingham) as part of Extremal and probabilistic combinator
 ics webinar\n\n\nAbstract\nThe celebrated <a href="https://en.wikipedia.or
 g/wiki/Erd%C5%91s%E2%80%93Faber%E2%80%93Lov%C3%A1sz_conjecture">Erdős–F
 aber–Lovász conjecture</a> (posed in 1972) states that the chromatic in
 dex of any linear hypergraph on n vertices is at most n. In this talk\, I 
 will sketch a proof                                                       
                                                                           
                                              \nof this conjecture for ever
 y large n.\n\nHistory of the problem: <a href="http://www.math.ucsd.edu/~e
 rdosproblems/erdos/newproblems/ErdosFaberLovasz.html">Erdős problems\, UC
 SD</a>.\n\nJoint work with D. Kang\, T. Kelly\, D.Kuhn and D. Osthus.\n
LOCATION:https://researchseminars.org/talk/EPC/52/
END:VEVENT
END:VCALENDAR