{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T06:50:10Z","timestamp":1768719010646,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:00:00Z","timestamp":1712534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331012"],"award-info":[{"award-number":["12331012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00373-024-02781-w","type":"journal-article","created":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T05:01:34Z","timestamp":1712552494000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Stability of Generalized Tur\u00e1n Number for Linear Forests"],"prefix":"10.1007","volume":"40","author":[{"given":"Yisai","family":"Xue","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yichong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7752-0392","authenticated-orcid":false,"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,8]]},"reference":[{"key":"2781_CR1","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.jctb.2016.03.004","volume":"121","author":"N Alon","year":"2016","unstructured":"Alon, N., Shikhelman, C.: Many $$T$$ copies in $$H$$-free graphs. J. Combin. Theory Ser. B 121, 146\u2013172 (2016)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2781_CR2","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15, 111\u2013135 (1976)","journal-title":"Discrete Math."},{"key":"2781_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jctb.2021.05.005","volume":"151","author":"D Chakraborti","year":"2021","unstructured":"Chakraborti, D., Chen, D.: Many cliques with few edges and bounded maximum degree. J. Combin. Theory Ser. B 151, 1\u201320 (2021)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2781_CR4","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1016\/j.dam.2020.08.001","volume":"287","author":"X Duan","year":"2020","unstructured":"Duan, X., Ning, B., Peng, X., et al.: Maximizing the number of cliques in graphs with given matching number. Discrete Appl. Math. 287, 110\u2013117 (2020)","journal-title":"Discrete Appl. Math."},{"key":"2781_CR5","first-page":"459","volume":"7","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P.: On the number of complete subgraphs contained in certain graphs. Magy. Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl. 7, 459\u2013474 (1962)","journal-title":"Magy. Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl."},{"key":"2781_CR6","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Erd\u0151s","year":"1959","unstructured":"Erd\u0151s, P., Gallai, T.: On maximal paths and circuits of graphs. Acta Math. Acad. Sci. Hungar. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2781_CR7","doi-asserted-by":"publisher","first-page":"1919","DOI":"10.1016\/j.disc.2019.03.008","volume":"342","author":"Z F\u00fcredi","year":"2019","unstructured":"F\u00fcredi, Z., Kostochka, A., Luo, R.: A variation of a theorem by P\u00f3sa. Discrete Math. 342, 1919\u20131923 (2019)","journal-title":"Discrete Math."},{"key":"2781_CR8","doi-asserted-by":"publisher","first-page":"3130","DOI":"10.1016\/j.disc.2019.06.022","volume":"342","author":"D Gerbner","year":"2019","unstructured":"Gerbner, D., Methuku, A., Vizer, M.: Generalized Tur\u00e1n problems for disjoint copies of graphs. Discrete Math. 342, 3130\u20133141 (2019)","journal-title":"Discrete Math."},{"key":"2781_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.jctb.2017.08.005","volume":"128","author":"R Luo","year":"2018","unstructured":"Luo, R.: The maximum number of cliques in graphs without long cycles. J. Combin. Theory Ser. B 128, 219\u2013226 (2018)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2781_CR10","doi-asserted-by":"publisher","first-page":"111924","DOI":"10.1016\/j.disc.2020.111924","volume":"343","author":"B Ning","year":"2020","unstructured":"Ning, B., Wang, J.: The formula for Tur\u00e1n number of spanning linear forests. Discrete Math. 343, 111924 (2020)","journal-title":"Discrete Math."},{"key":"2781_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/jctb.1996.0036","volume":"67","author":"B Pittel","year":"1996","unstructured":"Pittel, B., Spencer, J., Wormald, N.: Sudden emergence of a giant $$k$$-core in a random graph. J. Combin. Theory Ser. B 67, 111\u2013151 (1996)","journal-title":"J. Combin. Theory Ser. B"},{"key":"2781_CR12","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory (in Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"2781_CR13","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.dam.2018.07.014","volume":"254","author":"J Wang","year":"2019","unstructured":"Wang, J., Yang, W.: The Tur\u00e1n number for spanning linear forests. Discrete Appl. Math. 254, 291\u2013294 (2019)","journal-title":"Discrete Appl. Math."},{"key":"2781_CR14","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/s00373-021-02403-9","volume":"38","author":"L Zhang","year":"2022","unstructured":"Zhang, L., Wang, L., Zhou, J.: The Generalized Tur\u00e1n Number of Spanning Linear Forests. Graphs and Combinatorics 38, 40 (2022)","journal-title":"Graphs and Combinatorics"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02781-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02781-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02781-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:03:28Z","timestamp":1721707408000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02781-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,8]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2781"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02781-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,8]]},"assertion":[{"value":"26 January 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 April 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This research is supported by the National Nature Science Foundation of China (No. 12331012).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The authors declare that they have no Conflict of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"52"}}