Ringel's tree packing conjecture in quasirandom graphs

Keevash, Peter and Staden, Katherine (2024). Ringel's tree packing conjecture in quasirandom graphs. Journal of the European Mathematical Society (In Press).

DOI: https://doi.org/10.48550/arXiv.2004.09947

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.

Viewing alternatives

Metrics

Item Actions

Export

You can export this page using these formats Digital Object Identifier - DOI