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

A proof of Ringel's conjecture

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

  • UserAlexey Pokrovskiy (Birkbeck College, University of London)
  • ClockThursday 27 February 2020, 15:00-16:00
  • HouseWatson 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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.