A New Proof on the Bipartite Turán Number of Bipartite Graphs  

作　　者：Shiqian Wang Shiqian Wang(School of Mathematics and Statistics, Shandong Normal University, Jinan, China)

机构地区：[1]School of Mathematics and Statistics, Shandong Normal University, Jinan, China

出　　处：《Engineering（科研）》2024年第9期301-308,共8页工程（英文）（1947-3931）

摘　　要：The bipartite Turán number of a graph H, denoted by ex(m,n;H), is the maximum number of edges in any bipartite graph G=(A,B;E(G))with | A |=mand | B |=nwhich does not contain H as a subgraph. Whenmin{ m,n }>2t, the problem of determining the value of ex(m,n;Km−t,n−t)has been solved by Balbuena et al. in 2007, whose proof focuses on the structural analysis of bipartite graphs. In this paper, we provide a new proof on the value of ex(m,n;Km−t,n−t)by virtue of algebra method with the tool of adjacency matrices of bipartite graphs, which is inspired by the method using { 0,1 }-matrices due to Zarankiewicz [Problem P 101. Colloquium Mathematicum, 2(1951), 301].The bipartite Turán number of a graph H, denoted by ex(m,n;H), is the maximum number of edges in any bipartite graph G=(A,B;E(G))with | A |=mand | B |=nwhich does not contain H as a subgraph. Whenmin{ m,n }>2t, the problem of determining the value of ex(m,n;Km−t,n−t)has been solved by Balbuena et al. in 2007, whose proof focuses on the structural analysis of bipartite graphs. In this paper, we provide a new proof on the value of ex(m,n;Km−t,n−t)by virtue of algebra method with the tool of adjacency matrices of bipartite graphs, which is inspired by the method using { 0,1 }-matrices due to Zarankiewicz [Problem P 101. Colloquium Mathematicum, 2(1951), 301].

关 键 词：Bipartite Turán Number Adjacency Matrix Zarankiewicz Problem 

分 类 号：O15[理学—数学]