{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T17:06:55Z","timestamp":1784567215521,"version":"3.55.0"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571372"],"award-info":[{"award-number":["12571372"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004826","name":"Beijing Natural Science Foundation","doi-asserted-by":"publisher","award":["1262010"],"award-info":[{"award-number":["1262010"]}],"id":[{"id":"10.13039\/501100004826","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.ejc.2026.104412","type":"journal-article","created":{"date-parts":[[2026,6,17]],"date-time":"2026-06-17T10:28:45Z","timestamp":1781692125000},"page":"104412","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Tur\u00e1n type problems for a fixed graph and a linear forest"],"prefix":"10.1016","volume":"137","author":[{"given":"Haixiang","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiamiao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104412_b1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.jctb.2023.12.002","article-title":"Tur\u00e1n graphs with bounded matching number","volume":"165","author":"Alon","year":"2024","journal-title":"J. Combin. Theory Ser. B"},{"issue":"3","key":"10.1016\/j.ejc.2026.104412_b2","doi-asserted-by":"crossref","first-page":"683","DOI":"10.7151\/dmgt.1883","article-title":"The Tur\u00e1n number of the graph 2P5","volume":"36","author":"Bielak","year":"2016","journal-title":"Discuss. Math. Graph Theory"},{"issue":"6","key":"10.1016\/j.ejc.2026.104412_b3","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1017\/S0963548311000460","article-title":"Tur\u00e1n numbers of multiple paths and equibipartite forests","volume":"20","author":"Bushaw","year":"2011","journal-title":"Combin. Probab. Comput."},{"issue":"4","key":"10.1016\/j.ejc.2026.104412_b4","doi-asserted-by":"crossref","first-page":"1513","DOI":"10.7151\/dmgt.2507","article-title":"The Tur\u00e1n number of three disjoint paths","volume":"44","author":"Deng","year":"2024","journal-title":"Discuss. Math. Graph Theory"},{"key":"10.1016\/j.ejc.2026.104412_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.aam.2025.102936","article-title":"The number of edges in graphs with bounded clique number and circumference","volume":"171","author":"Dou","year":"2025","journal-title":"Adv. in Appl. Math."},{"key":"10.1016\/j.ejc.2026.104412_b6","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Acad. Sci. Hung."},{"issue":"5","key":"10.1016\/j.ejc.2026.104412_b7","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/s40314-024-02779-3","article-title":"The Tur\u00e1n number of P9\u222aP7","volume":"43","author":"Fang","year":"2024","journal-title":"Comput. Appl. Math."},{"issue":"10","key":"10.1016\/j.ejc.2026.104412_b8","doi-asserted-by":"crossref","first-page":"3395","DOI":"10.2298\/FIL2010395F","article-title":"The Tur\u00e1n number of the graph 3P5","volume":"34","author":"Feng","year":"2020","journal-title":"Filomat"},{"issue":"1","key":"10.1016\/j.ejc.2026.104412_b9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.23067","article-title":"On Tur\u00e1n problems with bounded matching number","volume":"106","author":"Gerbner","year":"2024","journal-title":"J. Graph Theory"},{"issue":"5","key":"10.1016\/j.ejc.2026.104412_b10","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1007\/s00373-010-0999-5","article-title":"Tur\u00e1n numbers for disjoint copies of graphs","volume":"27","author":"Gorgol","year":"2011","journal-title":"Graphs Combin."},{"key":"10.1016\/j.ejc.2026.104412_b11","first-page":"270","article-title":"The Tur\u00e1n number of star forests","volume":"348","author":"Lan","year":"2019","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.ejc.2026.104412_b12","article-title":"On the Tur\u00e1n number of forests","volume":"20","author":"Lidick\u1ef3","year":"2013","journal-title":"Electron. J. Combin."},{"key":"10.1016\/j.ejc.2026.104412_b13","series-title":"Extremal problems for star forests and cliques","author":"Lu","year":"2024"},{"key":"10.1016\/j.ejc.2026.104412_b14","article-title":"Tur\u00e1n number of complete bipartite graphs with bounded matching number","volume":"347","author":"Luo","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.ejc.2026.104412_b15","series-title":"Theory of Graphs (Proc. Colloq., Tihany, 1966)","first-page":"279","article-title":"A method for solving extremal problems in graph theory, stability problems","author":"Simonovits","year":"1968"},{"issue":"1","key":"10.1016\/j.ejc.2026.104412_b16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.4064\/cm-3-1-19-30","article-title":"On the theory of graphs","volume":"3","author":"Tur\u00e1n","year":"1954","journal-title":"Colloq. Math."},{"key":"10.1016\/j.ejc.2026.104412_b17","first-page":"241","article-title":"Tur\u00e1n number for pSr","volume":"97","author":"Yin","year":"2016","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"2","key":"10.1016\/j.ejc.2026.104412_b18","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.disc.2016.08.004","article-title":"The Tur\u00e1n number of disjoint copies of paths","volume":"340","author":"Yuan","year":"2017","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104412_b19","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/jgt.22710","article-title":"Tur\u00e1n numbers for disjoint paths","volume":"98","author":"Yuan","year":"2021","journal-title":"J. Graph Theory"},{"issue":"3","key":"10.1016\/j.ejc.2026.104412_b20","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s00373-022-02479-x","article-title":"The Tur\u00e1n numbers of special forests","volume":"38","author":"Zhang","year":"2022","journal-title":"Graphs Combin."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000806?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000806?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T16:42:27Z","timestamp":1784565747000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":20,"alternative-id":["S0195669826000806"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104412","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tur\u00e1n type problems for a fixed graph and a linear forest","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104412","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104412"}}