Now showing items 1-1 of 1

    • A sufficient degree condition for a graph to contain all trees of size k 

      Balbuena Martínez, Maria Camino Teófila; Márquez, Alberto; Portillo, Jose Ramón (Springer Verlag, 2011-01)
      Article
      Restricted access - publisher's policy
      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 ...