A proof of Ringel's conjecture

Add to your list(s) Download to your calendar using vCal

• Alexey Pokrovskiy (Birkbeck College, University of London)
• Thursday 27 February 2020, 15:00-16:00
• Watson LTC.

If you have a question about this talk, please contact Richard Montgomery.

Ringel 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.

This talk is part of the Combinatorics and Probability seminar series.

This talk is included in these lists:

• Combinatorics and Probability seminar
• School of Mathematics events
• Watson LTC

Note that ex-directory lists are not shown.