BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.bham.ac.uk//v3//EN
BEGIN:VEVENT
CATEGORIES:Combinatorics and Probability Seminar
SUMMARY:A proof of Ringel's conjecture - Alexey Pokrovskiy
(Birkbeck College\, University of London)
DTSTART:20200227T150000Z
DTEND:20200227T160000Z
UID:TALK4060AT
URL:/talk/index/4060
DESCRIPTION:Ringel conjectured that the edges of the complete
graph on\n2n+1 vertices can be decomposed into dis
joint copies of any n-edge tree T. This talk will
be about a recent proof of this conjecture for suf
ficiently large n.\n\nThis is joint work with Rich
ard Montgomery and Benny Sudakov.
LOCATION:Watson LTC
CONTACT:Richard Montgomery
END:VEVENT
END:VCALENDAR