BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Alexey Pokrovskiy (Birkbeck College)
DTSTART:20200427T130000Z
DTEND:20200427T140000Z
DTSTAMP:20260423T035411Z
UID:EPC/6
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/6/">Proo
 f of Ringel's conjecture</a>\nby Alexey Pokrovskiy (Birkbeck College) as p
 art of Extremal and probabilistic combinatorics webinar\n\n\nAbstract\nRin
 gel conjectured that the edges of the complete graph on 2n+1 vertices can 
 be decomposed into disjoint copies of any n-edge tree T. This talk will be
  about a recent proof of this conjecture for sufficiently large n. This is
  joint work with Richard Montgomery and Benny Sudakov.\n
LOCATION:https://researchseminars.org/talk/EPC/6/
END:VEVENT
END:VCALENDAR