Recent progress on tree packings.

Abstract:We say that a graph H decomposes a graph G if the edges of G can be partitioned into edge-disjoint copies of H. In 1976, Ringel conjectured that any tree of order n+1 decomposes the complete graph on 2n+1 vertices. Recently Montgomery, Pokrovskiy and Sudakov presented a proof of this conjecture for large n. In this talk, we will study the techniques used by Montgomery, Pokrovskiy and Sudakov to prove Ringel’s conjecture.

Posted on Apr 10, 2023 in Seminario de Grafos, Seminars