Ringel's tree packing conjecture in quasirandom graphs

Understand

We prove that any quasirandom graph with $n$ vertices and $rn$ edges can be decomposed into $n$ copies of any fixed tree with $r$ edges.

• The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.