×
Copy the page URI to the clipboard
Keevash, Peter and Staden, Katherine
(2024).
DOI: https://doi.org/10.48550/arXiv.2004.09947
URL: https://ems.press/journals/jems/articles/forthcomi...
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.