The Erdős-Sós conjecture for spiders of large size

DOI10.1016/j.disc.2013.07.021zbMath1281.05048OpenAlexW2042398323WikidataQ123330319 ScholiaQ123330319MaRDI QIDQ393909

Geng-Hua Fan

Publication date: 24 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.07.021

zbMATH Keywords

treespiderpackingErdős-Sós conjecture

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Embedding trees in graphs with independence number two ⋮ On a conjecture of Nikiforov involving a spectral radius condition for a graph to contain all trees ⋮ A Local Approach to the Erdös--Sós Conjecture ⋮ A variation of the Erdős-Sós conjecture in bipartite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Long cycles and the codiameter of a graph. I
• Edge disjoint placement of graphs
• Packings of graphs and applications to computational complexity
• The Erdős-Sós conjecture for spiders
• Packing a tree with a graph of the same size
• [https://portal.mardi4nfdi.de/wiki/Publication:4865531 On the Erd�s-S�s conjecture]

This page was built for publication: The Erdős-Sós conjecture for spiders of large size