共 50 条
On the Turán Numbers of Linear Forests in Bipartite Graphs
被引:0
|作者:
Tianying Xie
[1
]
Longtu Yuan
[2
]
机构:
[1] University of Science and Technology of China,School of Mathematical Sciences
[2] East China Normal University,School of Mathematical Sciences, Key Laboratory of MEA (Ministry of Education) & Shanghai Key Laboratory of PMMP
关键词:
Turán number;
Linear forest;
Bipartite graph;
05C35;
05C05;
D O I:
10.1007/s11401-024-0036-2
中图分类号:
学科分类号:
摘要:
A linear forest is a graph consisting of paths. In this paper, the authors determine the maximum number of edges in an (m, n)-bipartite graph which does not contain a linear forest consisting of paths on at least four vertices for n ≥ m when m is sufficiently large.
引用
收藏
页码:709 / 732
页数:23
相关论文