Proof of Ringel's conjecture

Alexey Pokrovskiy (Birkbeck College)

27-Apr-2020, 13:00-14:00 (4 years ago)

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.

combinatoricsprobability

Audience: researchers in the topic


Extremal and probabilistic combinatorics webinar

Series comments: We've added a password: concatenate the 6 first prime numbers (hence obtaining an 8-digit password).

Organizers: Jan Hladky*, Diana Piguet, Jan Volec*, Liana Yepremyan
*contact for this listing

Export talk to