Constructing trees in graphs with no K2,s

DOI10.1002/JGT.20261MaRDI QIDQ5434262zbMATH OpenOpenAlexFDO

Authors Suman Balasubramanian, Edward Dobson

Publication date 4 January 2008

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.20261

zbMATH Keywords

Erdős-Sós conjecturetrees

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Constructing Trees in Graphs whose Complement has no K_2,s
• scientific article; zbMATH DE number 1792598
• On the Erd�s-S�s conjecture
• scientific article; zbMATH DE number 3863220
• The Erdös-Sós conjecture for graphs without \(C_ 4\)

Cited in

(12)

• Subtrees and subforests of graphs
• A variation of the Erdős-Sós conjecture in bipartite graphs
• Graphs with at most two trees in a forest-building process
• On Erdős-Sós conjecture for trees of large size
• Turán numbers of multiple paths and equibipartite forests
• Constructing Trees in Graphs whose Complement has no K_2,s
• A new construction of a Kurepa tree with no Aronszajn subtree
• On the Erdős-Sós conjecture for graphs having no path with \(k+4\) vertices
• Embedding trees in graphs with independence number two
• A Local Approach to the Erdös--Sós Conjecture
• How connectivity affects the extremal number of trees
• Antidirected trees in dense digraphs

This page was built for publication: Constructing trees in graphs with no K_2,s

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