On the Turán Numbers of Linear Forests in Bipartite Graphs

扫码查看

原文链接

NETL
NSTL
万方数据

外文摘要：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.

外文关键词：

Turán numberLinear forestBipartite graph

作者：

Tianying XIE、Longtu YUAN

展开 >

作者单位：

School of Mathematical Sciences,University of Science and Technology of China Hefei 230026,China

School of Mathematical Sciences,Key Laboratory of ME A(Ministry of Education)& Shanghai Key Laboratory of PMMP,East China Normal University,Shanghai 200241,China

基金：

National Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Natural Science Foundation of ChinaNational Key R and D Program of ChinaAnhui Initiative in Quantum Information TechnologiesScience and Technology Commission of Shanghai Municipality

项目编号：

1212510612271169123310142020YFA0713100AHY15020022DZ2229014

出版年：

2024

DOI：

10.1007/s11401-024-0036-2

数学年刊B辑(英文版)

国家教育部委托复旦大学主办

数学年刊B辑(英文版)

CSTPCD

影响因子：0.129

ISSN：0252-9599

年,卷(期)：2024.45(5)