{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:00Z","timestamp":1740107100150,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,8]],"date-time":"2021-02-08T00:00:00Z","timestamp":1612742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11931002","11671124"],"award-info":[{"award-number":["11931002","11671124"]}],"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":"crossref","award":["11901193"],"award-info":[{"award-number":["11901193"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Natural Science Foundation of Hunan Province","award":["2019JJ50364"],"award-info":[{"award-number":["2019JJ50364"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00373-020-02270-w","type":"journal-article","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T18:22:13Z","timestamp":1612894933000},"page":"711-729","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Lagrangian densities of short 3-uniform linear paths and Tur\u00e1n numbers of their extensions"],"prefix":"10.1007","volume":"37","author":[{"given":"Biao","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,8]]},"reference":[{"key":"2270_CR1","doi-asserted-by":"publisher","first-page":"1149","DOI":"10.1007\/s00493-019-3831-8","volume":"39","author":"A Bene Watts","year":"2019","unstructured":"Bene Watts, A., Norin, S., Yepremyan, L.: A Tur\u00e1n theorem for extensions via an Erd\u0151s-Ko-Rado theorem for Lagrangians. Combinatorica 39, 1149\u20131171 (2019)","journal-title":"Combinatorica"},{"issue":"3","key":"2270_CR2","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1017\/S0963548316000444","volume":"26","author":"A Brandt","year":"2015","unstructured":"Brandt, A., Irwin, D., Jiang, T.: Stability and Tur\u00e1n numbers of a class of hypergraphs via Lagrangians. Combin. Probab. Comput. 26(3), 367\u2013405 (2015)","journal-title":"Combin. Probab. Comput."},{"key":"2270_CR3","doi-asserted-by":"publisher","unstructured":"Chen, P., Liang, J., Peng, Y.: The Lagrangian density OF 123, 234, 456 and the Tur\u00e1n number of its extension. Discussiones Mathematicae Graph Theory. https:\/\/doi.org\/10.7151\/dmgt.2219","DOI":"10.7151\/dmgt.2219"},{"key":"2270_CR4","first-page":"51","volume":"1","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Simonovits, M.: A limit theorem in graph theory. Studia Sci. Math. Hungar. 1, 51\u201357 (1966)","journal-title":"Studia Sci. Math. Hungar."},{"key":"2270_CR5","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.: Bull. Am. Math. Soc. 52, 1087\u20131091 (1946)","journal-title":"Bull. Am. Math. Soc."},{"key":"2270_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","volume":"52","author":"P Frankl","year":"1989","unstructured":"Frankl, P., F\u00fcredi, Z.: Extremal problems whose solutions are the blow-ups of the small Witt-designs. J. Combin. Theory Ser. A 52, 129\u2013147 (1989)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2270_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02579215","volume":"4","author":"P Frankl","year":"1984","unstructured":"Frankl, P., R\u00f6dl, V.: Hypergraphs do not jump. Combinatorica 4, 149\u2013159 (1984)","journal-title":"Combinatorica"},{"key":"2270_CR8","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1016\/j.jcta.2013.07.011","volume":"120","author":"D Hefetz","year":"2013","unstructured":"Hefetz, D., Keevash, P.: A hypergraph Tur\u00e1n theorem via Lagrangians of intersecting families. J. Combin. Theory Ser. A 120, 2020\u20132038 (2013)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2270_CR9","doi-asserted-by":"publisher","first-page":"125068","DOI":"10.1016\/j.amc.2020.125068","volume":"374","author":"S Hu","year":"2020","unstructured":"Hu, S., Peng, Y.: Lagrangian densities of enlargements of matchings in hypergraphs. Appl. Math. Comput. 374, 125068 (2020). https:\/\/doi.org\/10.1016\/j.amc.2020.125068","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"2270_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/jcd.21687","volume":"28","author":"S Hu","year":"2019","unstructured":"Hu, S., Peng, Y., Wu, B.: Lagrangian densities of linear forests and Tur\u00e1n numbers of their extensions. J. Combin. Des. 28(3), 207\u2013223 (2019)","journal-title":"J. Combin. Des."},{"key":"2270_CR11","unstructured":"Jenssen, M.: Continous Optimisation in Extremal Combinatorics, Ph.D. dissertation, London School of Economics and Political Science (2017)"},{"key":"2270_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.ejc.2018.05.001","volume":"73","author":"T Jiang","year":"2018","unstructured":"Jiang, T., Peng, Y., Wu, B.: Lagrangian densities of some sparse hypergraphs and Tur\u00e1n numbers of their extensions. Eur. J. Comb. 73, 20\u201336 (2018)","journal-title":"Eur. J. Comb."},{"key":"2270_CR13","first-page":"83","volume-title":"Hypergrah Tur\u00e1n Problems, Surveys in Combinatorics","author":"P Keevash","year":"2011","unstructured":"Keevash, P.: Hypergrah Tur\u00e1n Problems, Surveys in Combinatorics, pp. 83\u2013140. Cambridge University Press, Cambridge (2011)"},{"key":"2270_CR14","first-page":"1027","volume":"56","author":"S Liu","year":"2019","unstructured":"Liu, S., Peng, Y.: Generating non-jumping numbers of hypergraphs. Bull. Korean Math. Soc. 56, 1027\u20131039 (2019)","journal-title":"Bull. Korean Math. Soc."},{"key":"2270_CR15","doi-asserted-by":"publisher","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Tur\u00e1n. Can. J. Math 17, 533\u2013540 (1965)","journal-title":"Can. J. Math"},{"key":"2270_CR16","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/j.jcta.2016.09.003","volume":"146","author":"S Norin","year":"2017","unstructured":"Norin, S., Yepremyan, L.: Tur\u00e1n number of generalized triangles. J. Combin. Theory Ser. A 146, 312\u2013343 (2017)","journal-title":"J. Combin. Theory Ser. A"},{"key":"2270_CR17","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1016\/j.jcta.2017.08.004","volume":"155","author":"S Norin","year":"2018","unstructured":"Norin, S., Yepremyan, L.: Tur\u00e1n numbers of extensions. J. Combin. Theory 155, 476\u2013492 (2018)","journal-title":"J. Combin. Theory"},{"key":"2270_CR18","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00493-008-2187-2","volume":"28","author":"O Pikhurko","year":"2008","unstructured":"Pikhurko, O.: An exact Tur\u00e1n result for the generalized triangle. Combinatorica 28, 187\u2013208 (2008)","journal-title":"Combinatorica"},{"key":"2270_CR19","first-page":"433","volume":"41","author":"AF Sidorenko","year":"1987","unstructured":"Sidorenko, A.F.: On the maximal number of edges in a homogeneous hypergraph that does not contain prohibited subgraphs. Mat. Zametki 41, 433\u2013455 (1987)","journal-title":"Mat. Zametki"},{"key":"2270_CR20","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF02124681","volume":"9","author":"AF Sidorenko","year":"1989","unstructured":"Sidorenko, A.F.: Asymptotic solution for a new class of forbidden $$r$$-graphs. Combinatorica 9, 207\u2013215 (1989)","journal-title":"Combinatorica"},{"key":"2270_CR21","unstructured":"Wu, B., Peng, Y., Chen, P.: On a conjecture of Hefetz and Keevash on Lagrangians of intersecting hypergraphs and Tur\u00e1n numbers. arXiv:1701.06126 (2017)"},{"key":"2270_CR22","doi-asserted-by":"publisher","first-page":"2048","DOI":"10.1016\/j.disc.2019.03.024","volume":"342","author":"Z Yan","year":"2019","unstructured":"Yan, Z., Peng, Y.: Lagrangian densities of hypergraph cycles. Discrete Math. 342, 2048\u20132059 (2019)","journal-title":"Discrete Math."},{"issue":"66","key":"2270_CR23","first-page":"163","volume":"24","author":"A. A. Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Mat. Sbornik (N. S.) 24(66), 163\u2013188 (1949)","journal-title":"Mat. Sbornik (N. S.)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02270-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-020-02270-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02270-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,26]],"date-time":"2021-04-26T14:36:12Z","timestamp":1619447772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-020-02270-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,8]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["2270"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02270-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,2,8]]},"assertion":[{"value":"11 May 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}