Back to Search
Start Over
On the Turán Numbers of Linear Forests in Bipartite Graphs.
- Source :
-
Chinese Annals of Mathematics . Sep2024, Vol. 45 Issue 5, p709-732. 24p. - Publication Year :
- 2024
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- *BIPARTITE graphs
*AUTHORS
Subjects
Details
- Language :
- English
- ISSN :
- 02529599
- Volume :
- 45
- Issue :
- 5
- Database :
- Academic Search Index
- Journal :
- Chinese Annals of Mathematics
- Publication Type :
- Academic Journal
- Accession number :
- 180389857
- Full Text :
- https://doi.org/10.1007/s11401-024-0036-2