{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T11:28:12Z","timestamp":1775647692602,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:00:00Z","timestamp":1560902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T00:00:00Z","timestamp":1560902400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771221"],"award-info":[{"award-number":["11771221"]}],"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":["11811540390"],"award-info":[{"award-number":["11811540390"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006606","name":"Natural Science Foundation of Tianjin City","doi-asserted-by":"publisher","award":["17JCQNJC00300"],"award-info":[{"award-number":["17JCQNJC00300"]}],"id":[{"id":"10.13039\/501100006606","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":[[2019,9]]},"DOI":"10.1007\/s00373-019-02055-w","type":"journal-article","created":{"date-parts":[[2019,6,19]],"date-time":"2019-06-19T22:02:18Z","timestamp":1560981738000},"page":"1035-1049","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Planar Tur\u00e1n Numbers of Short Paths"],"prefix":"10.1007","volume":"35","author":[{"given":"Yongxin","family":"Lan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9406-7967","authenticated-orcid":false,"given":"Yongtang","family":"Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,19]]},"reference":[{"key":"2055_CR1","doi-asserted-by":"publisher","first-page":"4487","DOI":"10.1016\/j.disc.2007.08.047","volume":"308","author":"PN Balister","year":"2008","unstructured":"Balister, P.N., Gy\u0151ri, E., Lehel, J., Schelp, R.H.: Connected graphs without long paths. Discrete Math. 308, 4487\u20134494 (2008)","journal-title":"Discrete Math."},{"key":"2055_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J Bondy","year":"1974","unstructured":"Bondy, J., Simonovits, M.: Cycles of even length in graphs. J. Comb. Theory Ser. B 16, 97\u2013105 (1974)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2055_CR3","volume-title":"Modern Graph Theory","author":"B Bollob\u00e1s","year":"2013","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, New York (2013)"},{"key":"2055_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/jgt.21991","volume":"83","author":"C Dowden","year":"2016","unstructured":"Dowden, C.: Extremal $$C_4$$-free\/$$C_5$$-free planar graphs. J. Graph Theory 83, 213\u2013230 (2016)","journal-title":"J. Graph Theory"},{"key":"2055_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579234","volume":"2","author":"P Erd\u0151s","year":"1982","unstructured":"Erd\u0151s, P., Simonovits, M.: Compactness results in extremal graph theory. Combinatorica 2, 275\u2013288 (1982)","journal-title":"Combinatorica"},{"key":"2055_CR6","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P Erd\u0151s","year":"1946","unstructured":"Erd\u0151s, P., Stone, A.H.: On the structure of linear graphs. Bull. Am. Math. Soc. 52, 1087\u20131091 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"2055_CR7","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0095-8956(75)90080-5","volume":"19","author":"RJ Faudree","year":"1975","unstructured":"Faudree, R.J., Schelp, R.H.: Path Ramsey numbers in multicolourings. J. Comb. Theory Ser. B 19, 150\u2013160 (1975)","journal-title":"J. Comb. Theory Ser. B"},{"key":"2055_CR8","doi-asserted-by":"crossref","unstructured":"F\u00fcredi, Z.: Tur\u00e1n type problems. In: Surveys in Combinatorics, London Mathematical Society Lecture Note Series 166, pp. 253\u2013300. Cambridge University Press, Cambridge (1991)","DOI":"10.1017\/CBO9780511666216.010"},{"key":"2055_CR9","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.jcta.2013.12.009","volume":"123","author":"Z F\u00fcredi","year":"2014","unstructured":"F\u00fcredi, Z., Jiang, T.: Hypergraph Tur\u00e1n numbers of linear cycles. J. Comb. Theory Ser. A 123, 252\u2013270 (2014)","journal-title":"J. Comb. Theory Ser. A"},{"key":"2055_CR10","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s00493-014-2838-4","volume":"34","author":"Z F\u00fcredi","year":"2014","unstructured":"F\u00fcredi, Z., Jiang, T., Seiver, R.: Exact solution of the hypergraph Tur\u00e1n problem for $$k$$-uniform linear paths. Combinatorica 34, 299\u2013322 (2014)","journal-title":"Combinatorica"},{"key":"2055_CR11","doi-asserted-by":"crossref","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n problems. In: Surveys in Combinatorics 2011, London Mathematical Society Lecture Note Series 392, pp. 83\u2013139. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9781139004114.004"},{"key":"2055_CR12","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.jcta.2014.09.005","volume":"129","author":"A Kostochka","year":"2015","unstructured":"Kostochka, A., Mubayi, D., Verstra\u00ebte, J.: Tur\u00e1n problems and shadows I: paths and cycles. J. Comb. Theory Ser. A 129, 57\u201379 (2015)","journal-title":"J. Comb. Theory Ser. A"},{"key":"2055_CR13","unstructured":"Lan, Y., Shi, Y., Song, Z-X.: Extremal Theta-free planar graphs. \n                    arXiv:1711.01614"},{"key":"2055_CR14","doi-asserted-by":"crossref","first-page":"2.11","DOI":"10.37236\/8255","volume":"26","author":"Y Lan","year":"2019","unstructured":"Lan, Y., Shi, Y., Song, Z.-X.: Extremal $$H$$-free planar graphs. Electron. J. Comb. 26, 2.11 (2019)","journal-title":"Electron. J. Comb."},{"key":"2055_CR15","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie, (Hungarian) Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Fiz. Lapok"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02055-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-019-02055-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-019-02055-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T23:21:10Z","timestamp":1592436070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-019-02055-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,19]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["2055"],"URL":"https:\/\/doi.org\/10.1007\/s00373-019-02055-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,19]]},"assertion":[{"value":"23 May 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 June 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}