Journal article
Ringel’s tree packing conjecture in quasirandom graphs
- Abstract:
- We prove that any quasirandom graph with n vertices and rn edges can be decomposed into n copies of any fixed tree with r edges. The case of decomposing a complete graph establishes a conjecture of Ringel from 1963.
- Publication status:
- Published
- Peer review status:
- Peer reviewed
Actions
Access Document
- Files:
-
-
(Preview, Version of record, pdf, 849.5KB, Terms of use)
-
- Publisher copy:
- 10.4171/jems/1604
Authors
- Publisher:
- EMS Press
- Journal:
- Journal of the European Mathematical Society More from this journal
- Volume:
- 27
- Issue:
- 5
- Pages:
- 1769-1826
- Publication date:
- 2025-02-21
- DOI:
- EISSN:
-
1435-9863
- ISSN:
-
1435-9855
- Language:
-
English
- Keywords:
- Pubs id:
-
2099212
- Local pid:
-
pubs:2099212
- Source identifiers:
-
W4407814312
- Deposit date:
-
2026-01-14
- ARK identifier:
This ORA record was generated from metadata provided by an external service. It has not been edited by the ORA Team.
Terms of use
- Copyright date:
- 2025
- Licence:
- CC Attribution (CC BY)
If you are the owner of this record, you can report an update to it here: Report update to this record