{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:07Z","timestamp":1780783147543,"version":"3.54.1"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_2","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:08Z","timestamp":1780780508000},"page":"16-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on\u00a0Linear Tur\u00e1n Number for\u00a0Trees"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-2723-5550","authenticated-orcid":false,"given":"Rajat","family":"Adak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7725-9424","authenticated-orcid":false,"given":"Pragya","family":"Verma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bruck, R.H., Ryser, H.J.: The nonexistence of certain finite projective planes. Can. J. Math. 1(1), 88\u201393 (1949)","DOI":"10.4153\/CJM-1949-009-2"},{"key":"2_CR2","unstructured":"Carbonero, A., Fletcher, W., Guo, J., Gy\u00e1rf\u00e1s, A., Wang, R., Yan, S.: Crowns in linear $$3 $$-graphs, arXiv preprint (2021)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Carbonero, A., Fletcher, W., Guo, J., Gy\u00e1rf\u00e1s, A., Wang, R., Yan, S.: Crowns in linear $$3 $$-graphs of minimum degree $$4$$. Electron. J. Comb. P4\u201317 (2022)","DOI":"10.37236\/11037"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Chowla, S., Ryser, H.J.: Combinatorial problems. Can. J. Math. 2, 93\u201399 (1950)","DOI":"10.4153\/CJM-1950-009-8"},{"issue":"3","key":"2_CR5","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S0963548317000530","volume":"27","author":"C Collier-Cartaino","year":"2018","unstructured":"Collier-Cartaino, C., Graber, N., Jiang, T.: Linear Tur\u00e1n numbers of linear cycles and cycle-complete Ramsey numbers. Comb. Probab. Comput. 27(3), 358\u2013386 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ejc.2017.10.006","volume":"69","author":"A Davoodi","year":"2018","unstructured":"Davoodi, A., Gy\u0151ri, E., Methuku, A., Tompkins, C.: An Erd\u0151s-Gallai type theorem for uniform hypergraphs. Eur. J. Comb. 69, 159\u2013162 (2018)","journal-title":"Eur. J. Comb."},{"key":"2_CR7","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, 337\u2013356 (1959)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2_CR8","unstructured":"Erdos, P.: Extremal problems in graph theory. In: Theory of Graphs and its Applications (Proc. Sympos. Smolenice, 1963), pp. 29\u201336 (1964)"},{"key":"2_CR9","unstructured":"Fletcher, W.: Improved Upper Bound on the Linear Tur\u00e1n Number of the Crown, arXiv preprint (2021)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"F\u00fcredi, Z.: Tur\u00e1n type problems. Surveys in combinatorics 166, 253\u2013300 (1991)","DOI":"10.1017\/CBO9780511666216.010"},{"issue":"3","key":"2_CR11","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(3), 299\u2013322 (2014)","journal-title":"Combinatorica"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"F\u00fcredi, Z., Simonovits, M.: The history of degenerate (bipartite) extremal graph problems. In: Erd\u0151s Centennial, pp. 169\u2013264. Springer, Cham (2013)","DOI":"10.1007\/978-3-642-39286-3_7"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Gerbner, D., Patk\u00f3s, B.: Extremal finite set theory, Chapman and Hall\/CRC (2018)","DOI":"10.1201\/9780429440809"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M., S\u00e1rk\u00f6zy, G.N.: Linear Tur\u00e1n numbers of acyclic triple systems. Eur. J. Comb. 99, 103435 (2022)","DOI":"10.1016\/j.ejc.2021.103435"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: Tur\u00e1n and Ramsey numbers in linear triple systems. Discret. Math. 344(3), 112258 (2021)","DOI":"10.1016\/j.disc.2020.112258"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Gy\u00e1rf\u00e1s, A., S\u00e1rk\u00f6zy, G.N.: The linear Tur\u00e1n number of small triple systems or why is the wicket interesting? Discrete Math. 345(11), 113025 (2022)","DOI":"10.1016\/j.disc.2022.113025"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Gy\u0151ri, E., Katona, G.Y., Lemons, N.: hypergraph extensions of the Erd\u0151s-Gallai theorem. Eur. J. Comb. 58, 238\u2013246 (2016)","DOI":"10.1016\/j.ejc.2016.05.012"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n Problems. Surv. Comb. 392, 83\u2013140 (2011)","DOI":"10.1017\/CBO9781139004114.004"},{"key":"2_CR19","unstructured":"Keevash, P.: The existence of designs. arXiv preprint (2014)"},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2022.103506","volume":"102","author":"O Khormali","year":"2022","unstructured":"Khormali, O., Palmer, C.: Tur\u00e1n numbers for hypergraph star forests. Eur. J. Comb. 102, 103506 (2022)","journal-title":"Eur. J. Comb."},{"issue":"6","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1681","DOI":"10.1016\/j.ejc.2006.07.001","volume":"28","author":"D Mubayi","year":"2007","unstructured":"Mubayi, D., Verstra\u00ebte, J.: Minimal paths and cycles in set systems. Eur. J. Comb. 28(6), 1681\u20131693 (2007)","journal-title":"Eur. J. Comb."},{"key":"2_CR22","unstructured":"Ruzsa, I.Z., Szemer\u00e9di, E.: Triple systems with no six points carrying three triangles. Combinatorics (Keszthely, 1976), Coll. Math. Soc. J. Bolyai 18(939\u2013945), 2 (1978)"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"S\u00e1rk\u00f6zy, G.N.: Tur\u00e1n and Ramsey numbers in linear triple systems II. Discret. Math. 346(1), 113182 (2023)","DOI":"10.1016\/j.disc.2022.113182"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Tang, C., Wu, H., Zhang, S., Zheng, Z.: On the Tur\u00e1n Number of the Linear $$3$$-Graph $$C_{13}$$. Electron. J. Comb. P3\u201346 (2022)","DOI":"10.37236\/10775"},{"key":"2_CR25","unstructured":"Tur\u00e1n, P.: Egy gr\u00e1felm\u00e9leti sz\u00e9lso\u00e9rt\u00e9kfeladatr\u00f3l. Mat. Fiz. Lapok 48(3), 436 (1941)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, L.-P., Broersma, H., Wang, L.: Generalized crowns in linear $$ r $$-graphs. Electron. J. Comb. pp. P1\u201329 (2025)","DOI":"10.37236\/12721"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2024.114219","volume":"348","author":"L-P Zhang","year":"2025","unstructured":"Zhang, L.-P., Broersma, H., Wang, L.: Tur\u00e1n numbers of general star forests in hypergraphs. Discret. Math. 348(1), 114219 (2025)","journal-title":"Discret. Math."},{"key":"2_CR28","first-page":"1","volume-title":"The Linear Tur\u00e1n Numbers of Acyclic Linear 4-graphs","author":"L Zhang","year":"2025","unstructured":"Zhang, L., Wang, L.: The Linear Tur\u00e1n Numbers of Acyclic Linear 4-graphs, pp. 1\u201313. Acta Mathematicae Applicatae Sinica, English Series (2025)"},{"issue":"11","key":"2_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2025.114592","volume":"348","author":"J Zhou","year":"2025","unstructured":"Zhou, J., Yuan, X.: Tur\u00e1n problems for star-path forests in hypergraphs. Discret. Math. 348(11), 114592 (2025)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:15:15Z","timestamp":1780780515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}