Buscar
Mostrando ítems 1-1 de 1
Artículo
A sufficient degree condition for a graph to contain all trees of size k
(Springer, 2011)
The Erdös–Sós conjecture says that a graph G on n vertices and number of edges e(G) > n(k − 1)/2 contains all trees of size k. In this paper we prove a sufficient condition for a graph to contain every tree of size k ...