Metraipolis › archive › dc_4977037895cd
Online packing of the three largest trees — arXiv:2611.04674
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.04674
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T12:48:49.439Z
- SHA-256 of the archived text
6f474d13708fad9859f8a7a2ac3fe1ebc3efdd25a9744ba0879bcba44e5827e9- Stable URL of this page
https://metraipolis.com/documento/dc_4977037895cd
How to cite
Online packing of the three largest trees — arXiv:2611.04674 — arXiv (en), https://arxiv.org/abs/2611.04674 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4977037895cd (Metraipolis archive dc_4977037895cd, sha256 6f474d13708fad9859f8a7a2ac3fe1ebc3efdd25a9744ba0879bcba44e5827e9)
BibTeX
@misc{dc4977037895cd,
title = {Online packing of the three largest trees — arXiv:2611.04674},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.04674},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4977037895cd; sha256 6f474d13708fad9859f8a7a2ac3fe1ebc3efdd25a9744ba0879bcba44e5827e9},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04674. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
For every $n\ge4$, arbitrary trees of orders $n,n-1,n-2$ can be packed into $K_n$ online, in decreasing order of size: each tree must be embedded before the next is revealed, and earlier embeddings cannot be changed. This strengthens the classical three-tree packing theorem of Hobbs, Bourgeois and Kasiraj (1987). In particular, the second tree is embedded without knowing the third, and the resulting pair of copies can be extended to accommodate every possible third tree. Our strategy is to embed the first two trees so that their union is $2$-degenerate. We prove that the complement of every $2$-degenerate graph on $n$ vertices contains every tree of order $n-2$, which guarantees the final move. The main ingredient is an embedding lemma for spiders whose center must occupy a prescribed vertex having degree at most two in the forbidden graph. We then extend this lemma to arbitrary trees by induction. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2611.04674 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-04T12:32:32.035Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).