{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:13Z","timestamp":1740107113305,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T00:00:00Z","timestamp":1665792000000},"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":["11971406","12171402"],"award-info":[{"award-number":["11971406","12171402"]}],"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":[[2022,12]]},"DOI":"10.1007\/s00373-022-02580-1","type":"journal-article","created":{"date-parts":[[2022,10,15]],"date-time":"2022-10-15T03:23:59Z","timestamp":1665804239000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Maximum Number of Stars in a Graph Without Linear Forest"],"prefix":"10.1007","volume":"38","author":[{"given":"Sumin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6399-1452","authenticated-orcid":false,"given":"Jianguo","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,15]]},"reference":[{"key":"2580_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":"2580_CR2","doi-asserted-by":"publisher","first-page":"4332","DOI":"10.1016\/j.disc.2007.08.016","volume":"308","author":"B Bollob\u00e1s","year":"2008","unstructured":"Bollob\u00e1s, B., Gy\u0151ri, E.: Pentagons vs. triangles. Discrete Math. 308, 4332\u20134336 (2008)","journal-title":"Discrete Math."},{"key":"2580_CR3","first-page":"459","volume":"7","author":"P Erd\u0151s","year":"1962","unstructured":"Erd\u0151s, P.: On the number of complete subgraphs contained in certain graph. Magya Tud Akad. Mat. Kut. Int. K\u00f6zl. 7, 459\u2013474 (1962)","journal-title":"Magya Tud Akad. Mat. Kut. Int. K\u00f6zl."},{"key":"2580_CR4","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. Hung. 10, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"2580_CR5","first-page":"14","volume":"21","author":"E Gy\u0151ri","year":"2019","unstructured":"Gy\u0151ri, E., Salia, N., Tompkins, C., Zamora, O.: The maximum number of $$P_l$$ copies in $$P_k$$-free graphs. Discrete Math. Theor. Comput. Sci. 21, 14 (2019)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"2","key":"2580_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.37236\/3142","volume":"20","author":"B Lidick\u00fd","year":"2013","unstructured":"Lidick\u00fd, B., Liu, H., Palmer, C.: On the Tur\u00e1n number of forests. Electron. J. Combin. 20(2), 62 (2013)","journal-title":"Electron. J. Combin."},{"key":"2580_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111924","author":"B Ning","year":"2020","unstructured":"Ning, B., Wang, J.: The formula for Tur\u00e1n number of spanning liner forests. Discrete Math. (2020). https:\/\/doi.org\/10.1016\/j.disc.2020.111924","journal-title":"Discrete Math."},{"key":"2580_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2019.103057","author":"J Wang","year":"2020","unstructured":"Wang, J.: The shifting method and generalized Tur\u00e1n number of matching. Eur. J. Combin. (2020). https:\/\/doi.org\/10.1016\/j.ejc.2019.103057","journal-title":"Eur. J. Combin."},{"key":"2580_CR9","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.H.: The Tur\u00e1n number of spanning linear forests. Discrete Appl. Math. 254, 291\u2013294 (2019)","journal-title":"Discrete Appl. Math."},{"key":"2580_CR10","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","volume":"340","author":"LT Yuan","year":"2017","unstructured":"Yuan, L.T., Zhang, X.D.: The Tur\u00e1n number of disjoint copies of path. Discrete Math. 340, 132\u2013139 (2017)","journal-title":"Discrete Math."},{"key":"2580_CR11","doi-asserted-by":"crossref","unstructured":"Zhang, L.P., Wang, L.G., Zhou, J.L.: The generalized Tur\u00e1n number of spanning linear forests. arXiv:2009.00181 (2021)","DOI":"10.7151\/dmgt.2368"},{"key":"2580_CR12","doi-asserted-by":"publisher","first-page":"1437","DOI":"10.1007\/s00373-021-02329-2","volume":"37","author":"XT Zhu","year":"2021","unstructured":"Zhu, X.T., Zhang, F.F., Chen, Y.J.: Generalized Tur\u00e1n number of even linear forests. Graph Combin. 37, 1437\u20131449 (2021)","journal-title":"Graph Combin."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02580-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02580-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02580-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,9]],"date-time":"2022-12-09T19:27:43Z","timestamp":1670614063000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02580-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,15]]},"references-count":12,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["2580"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02580-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,10,15]]},"assertion":[{"value":"7 February 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"173"}}