A variation of the Erdős-Sós conjecture in bipartite graphs

DOI10.1007/s00373-017-1767-6zbMath1368.05077arXiv1702.03060OpenAlexW2586280130WikidataQ123029552 ScholiaQ123029552MaRDI QIDQ2014230

Long-Tu Yuan, Xiao Dong Zhang

Publication date: 10 August 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.03060

zbMATH Keywords

treebipartite graphextremal graphErdős-Sós conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Kalai's conjecture in \(r\)-partite \(r\)-graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Erdős-Sós conjecture for spiders of large size
• Asymptotic solution for a new class of forbidden r-graphs
• Counterexample to a conjecture of Györi on \(C_{2l}\)-free bipartite graphs
• \(C_ 6\)-free bipartite graphs and product representation of squares
• The Erdös-Sós conjecture for graphs without \(C_ 4\)
• The Erdös-Sós conjecture for graphs of girth 5
• On the Turán number for the hexagon
• On Hamilton's ideals
• On Hamiltonian bipartite graphs
• Constructing Trees in Graphs whose Complement has no K_2,s
• On maximal paths and circuits of graphs
• An extremal problem for paths in bipartite graphs
• On the Erdős-Sós Conjecture for graphs on n = k + 4 vertices
• Cycles in bipartite graphs and an application in number theory
• [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
• The History of Degenerate (Bipartite) Extremal Graph Problems
• Constructing trees in graphs with no K_2,s
• On a problem of K. Zarankiewicz

This page was built for publication: A variation of the Erdős-Sós conjecture in bipartite graphs