A sufficient degree condition for a graph to contain all trees of size \(k\)

DOI10.1007/s10114-011-9617-6zbMath1222.05019OpenAlexW2061942211MaRDI QIDQ546277

Alberto Márquez, Camino Balbuena, José Ramón Portillo

Publication date: 24 June 2011

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-011-9617-6

zbMATH Keywords

Erdős-sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edge disjoint placement of graphs
• Asymptotic solution for a new class of forbidden r-graphs
• A variation of a conjecture due to Erdös and Sós
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)
• The Erdös-Sós conjecture for graphs of girth 5
• The Erdős-Sós conjecture for spiders
• Tree embeddings
• Constructing Trees in Graphs whose Complement has no K_2,s
• On maximal paths and circuits of graphs
• Packing a tree with a graph of the same size
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]
• The Erdős‐Sós Conjecture for trees of diameter four

This page was built for publication: A sufficient degree condition for a graph to contain all trees of size \(k\)