BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Katherine Staden
DTSTART:20200722T070000Z
DTEND:20200722T080000Z
DTSTAMP:20260423T005717Z
UID:CMSAcomb/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CMSAcomb/1/"
 >Two conjectures of Ringel</a>\nby Katherine Staden as part of Australasia
 n Combinatorics Seminar\n\n\nAbstract\nIn a graph decomposition problem\, 
 the goal is to partition the edge set of a host graph into a given set of 
 pieces. I will focus on the setting where both the host graph and the piec
 es have a comparable number of vertices\, and in particular on two conject
 ures of Ringel from the 60s on decomposing the complete graph: in the firs
 t (the generalised Oberwolfach problem) the pieces are 2-regular graphs\, 
 and in the second they are half-sized trees. I will give some ideas from m
 y recent proofs of these problems for large graphs in joint work with Pete
 r Keevash. The second conjecture was proved independently by Montgomery\, 
 Pokrovskiy and Sudakov.\n
LOCATION:https://researchseminars.org/talk/CMSAcomb/1/
END:VEVENT
END:VCALENDAR