On the Erdős-Sós conjecture and double-brooms

MaRDI QIDQ5500319zbMATH OpenFDO

Authors Gary Tiner

Publication date 5 August 2015

zbMATH Keywords

leg of a spiderspider

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• On the Erdős-Sós conjecture for graphs on n = k + 4 vertices
• On the Erdős-Sós conjecture for graphs on n=k+3 vertices.
• On the Erdős-Sós conjecture and graphs with large minimum degree.
• The Erdős-Sós conjecture for spiders of large size
• The Erdős‐Sós Conjecture for trees of diameter four

Cited in

(2)

• On the Erdős-Sós conjecture for graphs with circumference at most k+1
• scientific article; zbMATH DE number 7339186 (Why is no real title available?)

This page was built for publication: On the Erdős-Sós conjecture and double-brooms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5500319)