The asymptotic version of the Erdős-Sós conjecture and beyond

Akbar Davoodi, Diana Piguet, Hanka Řada +1

KlimoÅ¡ová, Piguet, and Rozhoň conjectured that any graph with minimum degree $k/2$ and sufficiently many vertices of degree $k$ should contain all trees with $k$ edges. We prove…