{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T22:43:37Z","timestamp":1781736217111,"version":"3.54.5"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T00:00:00Z","timestamp":1718841600000},"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":["12371347"],"award-info":[{"award-number":["12371347"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12271337"],"award-info":[{"award-number":["12271337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2024,7]]},"DOI":"10.1007\/s40314-024-02779-3","type":"journal-article","created":{"date-parts":[[2024,6,20]],"date-time":"2024-06-20T07:02:07Z","timestamp":1718866927000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Tur\u00e1n number of $$P_9 \\cup P_7$$"],"prefix":"10.1007","volume":"43","author":[{"given":"Xiaona","family":"Fang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4503-694X","authenticated-orcid":false,"given":"Lihua","family":"You","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,6,20]]},"reference":[{"key":"2779_CR1","doi-asserted-by":"publisher","first-page":"4487","DOI":"10.1016\/j.disc.2007.08.047","volume":"308","author":"PE Balister","year":"2008","unstructured":"Balister PE, Gy\u0151ri E, Lehel J, Schelp RH (2008) Connected graphs without long paths. Discrete Math 308:4487\u20134494","journal-title":"Discrete Math"},{"key":"2779_CR2","doi-asserted-by":"publisher","first-page":"683","DOI":"10.7151\/dmgt.1883","volume":"36","author":"H Bielak","year":"2016","unstructured":"Bielak H, Kieliszek S (2016) The Tur\u00e1n number of the graph $$2P_5$$. Disuss Math Graph Theory 36:683\u2013694","journal-title":"Disuss Math Graph Theory"},{"key":"2779_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1017\/S0963548311000460","volume":"20","author":"N Bushaw","year":"2011","unstructured":"Bushaw N, Kettle N (2011) Tur\u00e1n numbers of multiple paths and equibipartite forests. Combin Probab Comput 20:837\u2013853","journal-title":"Combin Probab Comput"},{"key":"2779_CR4","doi-asserted-by":"publisher","DOI":"10.7151\/dmgt.2507","author":"J Deng","year":"2023","unstructured":"Deng J, Hou J, Zeng Q (2023) The Tur\u00e1n number of three disjoint paths. Discuss Math Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2507","journal-title":"Discuss Math Graph Theory"},{"key":"2779_CR5","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 (1959) On maximal paths and circuits of graphs. Acta Math Acad Sci Hung 10:337\u2013356","journal-title":"Acta Math Acad Sci Hung"},{"issue":"2","key":"2779_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0095-8956(75)90080-5","volume":"19","author":"RJ Faudree","year":"1975","unstructured":"Faudree RJ, Schelp RH (1975) Path Ramsey numbers in multicolorings. J Combin Theory Ser B 19(2):150\u2013160","journal-title":"J Combin Theory Ser B"},{"issue":"10","key":"2779_CR7","doi-asserted-by":"publisher","first-page":"3395","DOI":"10.2298\/FIL2010395F","volume":"34","author":"L Feng","year":"2020","unstructured":"Feng L, Hu Y (2020) The Tur\u00e1n number of the graph $$3P_5$$. Filomat 34(10):3395\u20133410","journal-title":"Filomat"},{"key":"2779_CR8","unstructured":"Kopylov GN (1997) Maximal paths and cycles in a graph. Dokl Akad Nauk SSSR 23:19\u201321 [English translation in Soviet Math. Dokl. 18 (1977) 593\u2013596]"},{"key":"2779_CR9","doi-asserted-by":"publisher","first-page":"805","DOI":"10.7151\/dmgt.2111","volume":"39","author":"Y Lan","year":"2019","unstructured":"Lan Y, Qin Z, Shi Y (2019) The Tur\u00e1n number of $$2P_7$$. Discuss Math Graph Theory 39:805\u2013814","journal-title":"Discuss Math Graph Theory"},{"issue":"2","key":"2779_CR10","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 (2013) On the Tur\u00e1n number of forests. Electron J Combin 20(2):62","journal-title":"Electron J Combin"},{"key":"2779_CR11","unstructured":"Mantel W (1907) Problem 28, soln. by H. Gouventak, W. Mantel, J. Teixeira de Mattes, F. Schuh and W.A. Wythoff. Wiskundige Opgaven 10:60\u201361"},{"key":"2779_CR12","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n P (1941) Eine Extremalaufgabe aus der Graphentheorie. Mat Fiz Lapok 48:436\u2013452 (in Hungarian)","journal-title":"Mat Fiz Lapok"},{"key":"2779_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","volume":"3","author":"P Tur\u00e1n","year":"1954","unstructured":"Tur\u00e1n P (1954) On the theory of graphs. Colloq Math 3:19\u201330","journal-title":"Colloq Math"},{"key":"2779_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","volume":"340","author":"LT Yuan","year":"2017","unstructured":"Yuan LT, Zhang XD (2017) The Tur\u00e1n number of disjoint copies of paths. Discrete Math 340:132\u2013139","journal-title":"Discrete Math"},{"issue":"3","key":"2779_CR15","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1002\/jgt.22710","volume":"98","author":"LT Yuan","year":"2021","unstructured":"Yuan LT, Zhang XD (2021) Tur\u00e1n numbers for disjoint paths. J Graph Theory 98(3):499\u2013524","journal-title":"J Graph Theory"},{"issue":"3","key":"2779_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-022-02479-x","volume":"38","author":"LP Zhang","year":"2022","unstructured":"Zhang LP, Wang L (2022) The Tur\u00e1n numbers of special forests. Graphs Combin 38(3):1\u201316","journal-title":"Graphs Combin"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02779-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-024-02779-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-024-02779-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T06:04:20Z","timestamp":1721023460000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-024-02779-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,20]]},"references-count":16,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,7]]}},"alternative-id":["2779"],"URL":"https:\/\/doi.org\/10.1007\/s40314-024-02779-3","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6,20]]},"assertion":[{"value":"19 December 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 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":"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":"291"}}