Ringel's tree packing conjecture in quasirandom graphs

Keevash, Peter and Staden, Katherine (2023). 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

About

• Item ORO ID
• 90364
• Item Type
• Journal Item
• ISSN
• 1435-9863
• Academic Unit or School
• Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
  Faculty of Science, Technology, Engineering and Mathematics (STEM)
• Related URLs
• • https://arxiv.org/abs/2004.09947(Publication)
• Depositing User
• Katherine Staden