Abstract
Given a graph T and a family of graphs \({\mathcal {F}}\), the generalized Turán number of \({\mathcal {F}}\) is the maximum number of copies of T in an \({\mathcal {F}}\)-free graph on n vertices, denoted by \(ex(n,T,{\mathcal {F}})\). A linear forest is a forest whose connected components are all paths and isolated vertices. Let \({\mathcal {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 \({\mathcal {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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alon, N., Shikhelman, C.: Many \(T\) copies in \(H\)-free graphs. J. Combin. Theory Ser. B 121, 146–172 (2016)
Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111–135 (1976)
Chakraborti, D., Chen, D.: Many cliques with few edges and bounded maximum degree. J. Combin. Theory Ser. B 151, 1–20 (2021)
Duan, X., Ning, B., Peng, X., et al.: Maximizing the number of cliques in graphs with given matching number. Discrete Appl. Math. 287, 110–117 (2020)
Erdős, P.: On the number of complete subgraphs contained in certain graphs. Magy. Tud. Akad. Mat. Kut. Intéz. Közl. 7, 459–474 (1962)
Erdős, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10, 337–356 (1959)
Füredi, Z., Kostochka, A., Luo, R.: A variation of a theorem by Pósa. Discrete Math. 342, 1919–1923 (2019)
Gerbner, D., Methuku, A., Vizer, M.: Generalized Turán problems for disjoint copies of graphs. Discrete Math. 342, 3130–3141 (2019)
Luo, R.: The maximum number of cliques in graphs without long cycles. J. Combin. Theory Ser. B 128, 219–226 (2018)
Ning, B., Wang, J.: The formula for Turán number of spanning linear forests. Discrete Math. 343, 111924 (2020)
Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant \(k\)-core in a random graph. J. Combin. Theory Ser. B 67, 111–151 (1996)
Turán, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436–452 (1941)
Wang, J., Yang, W.: The Turán number for spanning linear forests. Discrete Appl. Math. 254, 291–294 (2019)
Zhang, L., Wang, L., Zhou, J.: The Generalized Turán Number of Spanning Linear Forests. Graphs and Combinatorics 38, 40 (2022)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Funding
This research is supported by the National Nature Science Foundation of China (No. 12331012).
Conflict of interest
The authors declare that they have no Conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work is supported by the National Nature Science Foundation of China (grant number 12331012).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Xue, Y., Liu, Y. & Kang, L. Stability of Generalized Turán Number for Linear Forests. Graphs and Combinatorics 40, 52 (2024). https://doi.org/10.1007/s00373-024-02781-w
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-024-02781-w