Embedding trees using minimum and maximum degree conditions
Journal of the London Mathematical Society · 2026-11 · 114 (5)
DOI: 10.1112/jlms.70766 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of the London Mathematical Society, online erschienen am 12.11.2026. Verfasst von Alexey Pokrovskiy und 2 weiteren Autor:innen. Die Arbeit nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
A variant of the Erdős–Sós conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least and maximum degree at least contains a copy of every tree with edges. Both degree bounds are best possible. We confirm this conjecture for large trees with bounded maximum degree, by proving that for all and sufficiently large , every graph with and contains a copy of every tree with edges and . We also prove similar results where alternative degree conditions are considered. For the same class of trees, this verifies exactly a related conjecture of Besomi, Pavez‐Signé and Stein, and provides asymptotic confirmations of two others.
Zitieren
APA
Pokrovskiy, A., Versteegen, L., & Williams, E. (2026). Embedding trees using minimum and maximum degree conditions. Journal of the London Mathematical Society, 114(5). https://doi.org/10.1112/jlms.70766
Vancouver
Pokrovskiy A, Versteegen L, Williams E. Embedding trees using minimum and maximum degree conditions. Journal of the London Mathematical Society. 2026;114(5). doi:10.1112/jlms.70766
BibTeX
@article{Pokrovskiy2026,
author = {Pokrovskiy, Alexey and Versteegen, Leo and Williams, Ella},
title = {Embedding trees using minimum and maximum degree conditions},
journal = {Journal of the London Mathematical Society},
year = {2026},
volume = {114},
number = {5},
doi = {10.1112/jlms.70766}
}
EUVIMED