Ringel’s tree packing conjecture in quasirandom graphs
Peter Keevash
University of Oxford, Oxford, UKKatherine Staden
University of Oxford, Oxford, UK; The Open University, Milton Keynes, UK

Abstract
We prove that any quasirandom graph with vertices and edges can be decomposed into copies of any fixed tree with edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.
Cite this article
Peter Keevash, Katherine Staden, Ringel’s tree packing conjecture in quasirandom graphs. J. Eur. Math. Soc. (2025), published online first
DOI 10.4171/JEMS/1604