摘要
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.
基金
supported by 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)
Science and Technology Commission of Shanghai Municipality(No.22DZ2229014)。
