Extremal Graphs for Even Linear Forests in Bipartite Graphs

被引：1
|
作者：
Yuan, Long-Tu [1 ]
Zhang, Xiao-Dong [2 ]
机构：
[1] East China Normal Univ, Sch Math Sci, Shanghai Key Lab PMMP, Shanghai 200241, Peoples R China
[2] Shanghai Jiao Tong Univ, Sch Math Sci, MOE LSC, SHL MAC, Shanghai 200240, Peoples R China
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2024年 / 44卷 / 01期
基金：
中国国家自然科学基金;
关键词：
bipartite graph; linear forest; extremal graph; Turan number; TURAN NUMBER; PATHS;
D O I：
10.7151/dmgt.2429
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Zarankiewicz proposed the problem of determining the maximum number of edges in an (n, m)-bipartite graph containing no complete bipartite graph K-a,K-b. In this paper, we consider a variant of Zarankiewicz's problem and determine the maximum number of edges of an (n, m)-bipartite graph without containing a linear forest consisting of even paths. Moveover, all these extremal graphs are characterized in a recursion way.
引用
收藏
页码：5 / 16
页数：12
相关论文
共 50 条
12345