|
|
| |
| On the Tur´an Numbers of Linear Forests in Bipartite Graphs |
| |
Citation： |
Tianying XIE,Longtu YUAN.On the Tur´an Numbers of Linear Forests in Bipartite Graphs[J].Chinese Annals of Mathematics B,2024,45(5):709~732 |
| Page view： 83
Net amount： 57 |
Authors： |
Tianying XIE; Longtu YUAN |
Foundation： |
the National Natural Science Foundation of China (Nos. 12125106,
12271169, 12331014), National Key R and D Program of China (No. 2020YFA0713100), Anhui Initiative
in Quantum Information Technologies (No. AHY150200) and Science and Technology Commission of
Shanghai Municipality (No. 22DZ2229014). |
|
|
| 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. |
Keywords： |
Tur´an number, Linear forest, Bipartite graph |
Classification： |
05C35, 05C05 |
|
|
Download PDF Full-Text
|
|
|
|
