Back to Search
Start Over
Stability of Generalized Turán Number for Linear Forests.
- Source :
-
Graphs & Combinatorics . May2024, Vol. 40 Issue 3, p1-16. 16p. - Publication Year :
- 2024
-
Abstract
- Given a graph T and a family of graphs F , the generalized Turán number of F is the maximum number of copies of T in an F -free graph on n vertices, denoted by e x (n , T , F) . A linear forest is a forest whose connected components are all paths and isolated vertices. Let L k be the family of all linear forests of size k without isolated vertices. In this paper, we obtained the maximum possible number of r-cliques in G, where G is L k -free with minimum degree at least d. Furthermore, we give a stability version of the result. As an application of the stability version of the result, we obtain a clique version of the stability of the Erdős–Gallai Theorem on matchings. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 09110119
- Volume :
- 40
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Graphs & Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 176525015
- Full Text :
- https://doi.org/10.1007/s00373-024-02781-w