University of Birmingham > Talks@bham > Combinatorics and Probability Seminar > A proof of Ringel's conjecture

## A proof of Ringel's conjectureAdd 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:Note that ex-directory lists are not shown. |
## Other listsCargo Reading Group in Combinatorics and Probability Type the title of a new list here## Other talksTBC Theory: This is moved to next year, 2023 ! Plasmonic Electronic Paper [Colloquium:] Aperture Fever: The Extremely Large Telescope Order-theoretic fixed point theorems The science of the large scale heliosphere and the missions that made it possible |