{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:10Z","timestamp":1740107110830,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T00:00:00Z","timestamp":1653004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T00:00:00Z","timestamp":1653004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Hainan Provincial Natural Science Foundation of China","award":["122RC545"],"award-info":[{"award-number":["122RC545"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11961019"],"award-info":[{"award-number":["11961019"]}],"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,6]]},"DOI":"10.1007\/s00373-022-02502-1","type":"journal-article","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T16:03:27Z","timestamp":1653062607000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on the Tur\u00e1n Number of an Arbitrary Star Forest"],"prefix":"10.1007","volume":"38","author":[{"given":"Bing","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7139-4551","authenticated-orcid":false,"given":"Jian-Hua","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"2502_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications. North-Holland, New York (1976)"},{"issue":"3","key":"2502_CR2","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(3), 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hungar"},{"key":"2502_CR3","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s00373-010-0999-5","volume":"27","author":"I Gorgol","year":"2011","unstructured":"Gorgol, I.: Tur\u00e1n numbers for disjoint copies of graphs. Graphs Combin. 27, 661\u2013667 (2011)","journal-title":"Graphs Combin."},{"key":"2502_CR4","first-page":"270","volume":"348","author":"YX Lan","year":"2019","unstructured":"Lan, Y.X., Li, T., Shi, Y.T., Tu, J.H.: The Tur\u00e1n number of star forests. Appl. Math. Comput. 348, 270\u2013274 (2019)","journal-title":"Appl. Math. Comput."},{"key":"2502_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112653","volume":"345","author":"SS Li","year":"2022","unstructured":"Li, S.S., Yin, J.H., Li, J.Y.: The Tur\u00e1n number of $$k\\cdot S_\\ell $$. Discrete Math. 345, 112653 (2022)","journal-title":"Discrete Math."},{"key":"2502_CR6","volume":"385","author":"JY Li","year":"2020","unstructured":"Li, J.Y., Li, S.S., Yin, J.H.: On Tur\u00e1n number for $$S_{\\ell _1}\\cup S_{\\ell _2}$$. Appl. Math. Comput. 385, 125400 (2020)","journal-title":"Appl. Math. Comput."},{"key":"2502_CR7","volume":"407","author":"JY Li","year":"2021","unstructured":"Li, J.Y., Yin, J.H.: Some new results on the Tur\u00e1n number of star forests. Appl. Math. Comput. 407, 126320 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2502_CR8","doi-asserted-by":"publisher","first-page":"#P62","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), #P62 (2013)","journal-title":"Electron. J. Combin."},{"key":"2502_CR9","unstructured":"Simonovits, M.: A method for solving extremal problems in graph theory, Stability problems. In: Theory of Graphs. Academic Press, 279\u2013319 (1968)"},{"key":"2502_CR10","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: An extremal problem in graph theory (Hungarian). Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"},{"key":"2502_CR11","first-page":"241","volume":"97","author":"JH Yin","year":"2016","unstructured":"Yin, J.H., Rao, Y.: Tur\u00e1n number for $$p\\cdot Sr$$. J. Combin. Math. Combin. Comput. 97, 241\u2013245 (2016)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"2502_CR12","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 paths. Discrete Math. 340, 132\u2013139 (2017)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02502-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02502-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-02502-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T22:47:28Z","timestamp":1654814848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02502-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,20]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2502"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02502-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,5,20]]},"assertion":[{"value":"6 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"98"}}