Combinatorics and Probability Seminar

Alexey Pokrovskiy
Birkbeck London
A proof of Ringel's conjecture
Abstract: 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.
Monday February 17, 2020 at 2:00 PM in 612 SEO
Web Privacy Notice HTML 5 CSS FAE
UIC LAS MSCS > persisting_utilities > seminars >