In 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 the host graph and the pieces have a comparable number of vertices, and in particular on two conjectures of Ringel from the 60s on decomposing the complete graph: in the first (Ringel's conjecture) they are identical half-sized trees, and in the second (the Oberwolfach problem) they are identical 2-factors. I will give some ideas from my recent proofs of the first problem and a generalised version of the second, for large graphs, in joint work with Peter Keevash. The first conjecture was proved independently by Montgomery, Pokrovskiy and Sudakov.
This is a seminar of the Combinatorial Mathematics Society of Australasia.
To attend email email@example.com with the subject 'subscribe' to receive zoom details. [You only need to subscribe once, not for future talks.]
University of Oxford
Wed, 22/07/2020 - 5:00pm
Zoom meeting (see below)