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

Tianying XIE ¹Longtu YUAN²

扫码查看

作者信息

1. School of Mathematical Sciences,University of Science and Technology of China Hefei 230026,China
2. School of Mathematical Sciences,Key Laboratory of ME A(Ministry of Education)& Shanghai Key Laboratory of PMMP,East China Normal University,Shanghai 200241,China
折叠

Abstract

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.

Key words

Turán number/Linear forest/Bipartite graph

引用本文复制引用

基金项目

National Natural Science Foundation of China(12125106)

National Natural Science Foundation of China(12271169)

National Natural Science Foundation of China(12331014)

National Key R and D Program of China(2020YFA0713100)

Anhui Initiative in Quantum Information Technologies(AHY150200)

Science and Technology Commission of Shanghai Municipality(22DZ2229014)

出版年

2024

数学年刊B辑(英文版)

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

数学年刊B辑(英文版)

CSTPCD

影响因子：0.129

ISSN：0252-9599

段落导航