JournalsjemsVol. 27, No. 5pp. 1769–1826

Ringel’s tree packing conjecture in quasirandom graphs

  • Peter Keevash

    University of Oxford, Oxford, UK

  • Katherine Staden

    University of Oxford, Oxford, UK; The Open University, Milton Keynes, UK
Ringel’s tree packing conjecture in quasirandom graphs cover
Download PDF

This article is published open access under our Subscribe to Open model.

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. 27 (2025), no. 5, pp. 1769–1826

DOI 10.4171/JEMS/1604