Feb 17 2020

Combinatorics and Probability Seminar: A proof of Ringel’s conjecture, by Alexey Pokrovskiy

February 17, 2020

2:00 PM - 2:50 PM


612 SEO


Chicago, IL

Alexey Pokrovskiy (Birkbeck London): A proof of Ringel's conjecture

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.

Please click here to make changes to, or delete, this seminar announcement.


Will Perkins

Date posted

Feb 18, 2020

Date updated

Feb 18, 2020


Alexey Pokrovskiy | (Birkbeck London)