On the Turán numbers of linear forests in bipartite graphs

DOI10.1007/s11401-024-0036-2MaRDI QIDQ6632212

Longtu Yuan, Tianying Xie

Publication date: 4 November 2024

Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

zbMATH Keywords

bipartite graphTurán numberlinear forest

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• On the Turán number of forests
• Turán numbers for disjoint copies of graphs
• The Turán number of the graph \(2P_5\)
• Connected graphs without long paths
• Cycles in bipartite graphs
• Path Ramsey numbers in multicolorings
• Forbidding multiple copies of forestable graphs
• The Turań number of \(2P_7\)
• The Turán number of disjoint copies of paths
• Turán Numbers of Multiple Paths and Equibipartite Forests
• On maximal paths and circuits of graphs
• An extremal problem for paths in bipartite graphs
• The Turàn number of the graph 3P4
• Turán numbers for disjoint paths

This page was built for publication: On the Turán numbers of linear forests in bipartite graphs