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:20260404T163207Z
UID:EPC/6
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/EPC/6
 /">Proof of Ringel's conjecture</a>\nby Alexey Pokrovskiy (Birkbeck Colleg
 e) as part of Extremal and probabilistic combinatorics webinar\n\n\nAbstra
 ct\nRingel conjectured that the edges of the complete graph on 2n+1 vertic
 es 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://stable.researchseminars.org/talk/EPC/6/
END:VEVENT
END:VCALENDAR