BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Tom Kelly (Birmingham)
DTSTART:20210625T130000Z
DTEND:20210625T140000Z
DTSTAMP:20260423T020957Z
UID:WCS/31
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/WCS/31/">A p
 roof of the Erdős–Faber–Lovász conjecture</a>\nby Tom Kelly (Birming
 ham) as part of Warwick Combinatorics Seminar\n\n\nAbstract\nThe 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 joint work wi
 th Dong Yeap Kang\, Daniela Kühn\, Abhishek Methuku\, and Deryk Osthus\, 
 we proved this conjecture for every sufficiently large $n$. In this talk\,
  I will present the history of this conjecture and sketch our proof in som
 e special cases.\n
LOCATION:https://researchseminars.org/talk/WCS/31/
END:VEVENT
END:VCALENDAR