The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)

DOI10.1007/s10255-004-0178-7zbMath1055.05085OpenAlexW2041214937WikidataQ123186902 ScholiaQ123186902MaRDI QIDQ1884650

Jiong-Sheng Li, Jian Hua Yin

Publication date: 5 November 2004

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

Full work available at URL: https://doi.org/10.1007/s10255-004-0178-7

zbMATH Keywords

treegraphpacking

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (3)

Embedding trees in graphs with independence number two ⋮ A sufficient degree condition for a graph to contain all trees of size \(k\) ⋮ A variation of a conjecture due to Erdös and Sós

Cites Work

• Unnamed Item
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• 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]

This page was built for publication: The Erdős-Sós conjecture for graphs whose complements contain no \(C_4\)