Packing the largest trees in the tree packing conjecture
Journal of the European Mathematical Society · 15.05.2026
DOI: 10.4171/jems/1794 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the European Mathematical Society, erschienen am 15.05.2026. Verfasst von Barnabás Janzer und 1 weiteren Autor:innen.
Abstract (Originalsprache)
The famous tree packing conjecture of Gyárfás from 1976 says that any sequence of trees T_{1},\ldots,T_{n} such that |T_{i}|=i for each i\in [n] packs into the complete n -vertex graph K_{n} . Packing even just the largest trees in such a sequence has proven difficult, with Bollobás drawing attention to this in 1995 by conjecturing that, for each k , if n is sufficiently large then the largest k trees in any such sequence can be packed into K_{n} . This has only been shown for k\leq 5 , by Żak, despite many partial results and much related work on the full tree packing conjecture. We prove Bollobás’s conjecture, by showing that, moreover, a linear number of the largest trees can be packed in the tree packing conjecture.
Zitieren
APA
Janzer, B., & Montgomery, R. (2026). Packing the largest trees in the tree packing conjecture. Journal of the European Mathematical Society. https://doi.org/10.4171/jems/1794
Vancouver
Janzer B, Montgomery R. Packing the largest trees in the tree packing conjecture. Journal of the European Mathematical Society. 2026. doi:10.4171/jems/1794
BibTeX
@article{Janzer2026,
author = {Janzer, Barnabás and Montgomery, Richard},
title = {Packing the largest trees in the tree packing conjecture},
journal = {Journal of the European Mathematical Society},
year = {2026},
doi = {10.4171/jems/1794}
}
EUVIMED