{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:24:12Z","timestamp":1774045452558,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T00:00:00Z","timestamp":1391817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s00493-014-2838-4","type":"journal-article","created":{"date-parts":[[2014,2,8]],"date-time":"2014-02-08T06:33:10Z","timestamp":1391841190000},"page":"299-322","source":"Crossref","is-referenced-by-count":38,"title":["Exact solution of the hypergraph Tur\u00e1n problem for k-uniform linear paths"],"prefix":"10.1007","volume":"34","author":[{"given":"Zolt\u00e1n","family":"F\u00fcredi","sequence":"first","affiliation":[]},{"given":"Tao","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Seiver","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,2,8]]},"reference":[{"key":"2838_CR1","unstructured":"M. Ajtai, J. Koml\u00f3s, M. Simonovits, E. Szemer\u00e9di: The solution of the Edr\u0151s-S\u00f3s conjecture for large trees, Manuscripts."},{"key":"2838_CR2","volume-title":"Extremal graph theory","author":"B Bollob\u00e1s","year":"1978","unstructured":"B. Bollob\u00e1s: Extremal graph theory, Academic Press, London, 1978."},{"key":"2838_CR3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1112\/plms\/s3-36.2.369","volume":"36","author":"M Deza","year":"1978","unstructured":"M. Deza, P. Er\u0151s, P. Frankl: Intersection properties of systems of finite sets, Proc. London Math. Soc. (3) 36 (1978), 369\u2013384.","journal-title":"Proc. London Math. Soc. (3)"},{"key":"2838_CR4","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/jgt.20329","volume":"59","author":"P Dorbec","year":"2008","unstructured":"P. Dorbec, S. Gravier, G. S\u00e1rk\u00f6zy: Monochromatic Hamiltonian t-tight Bergecycles in hypergraphs, Journal of Graph Theory 59 (2008), 34\u201344.","journal-title":"Journal of Graph Theory"},{"key":"2838_CR5","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P Er\u0151s","year":"1959","unstructured":"P. Er\u0151s, T. Gallai: On maximal paths and circuits of graphs, Acta Math. Acad. Sci. Hungar. 10 (1959), 337\u2013356.","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2838_CR6","first-page":"93","volume":"8","author":"P Er\u0151s","year":"1965","unstructured":"P. Er\u0151s: A problem on independent r-tuples, Ann. Univ. Sci. Budapest 8 (1965), 93\u201395.","journal-title":"Ann. Univ. Sci. Budapest"},{"key":"2838_CR7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","volume":"12","author":"P Er\u0151s","year":"1961","unstructured":"P. Er\u0151s, C. Ko, R. Rado: Intersection theorems for systems of finite sets, Quart. J. Math. Oxford Ser. (2) 12 (1961), 313\u2013320.","journal-title":"Quart. J. Math. Oxford Ser. (2)"},{"key":"2838_CR8","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/S0021-9800(68)80051-1","volume":"5","author":"P Er\u0151s","year":"1968","unstructured":"P. Er\u0151s, D. J. Kleitman: On coloring graphs to maximize the portion of multicolored k-edges, J. Combin. Th. 5 (1968), 164\u2013169.","journal-title":"J. Combin. Th."},{"key":"2838_CR9","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0004972700025521","volume":"17","author":"P Frankl","year":"1977","unstructured":"P. Frankl: On families of finite sets no two of which intersect in a singleton, Bull. Austral. Math. Soc. 17 (1977), 125\u2013134.","journal-title":"Bull. Austral. Math. Soc."},{"key":"2838_CR10","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1016\/0097-3165(87)90016-1","volume":"45","author":"P Frankl","year":"1987","unstructured":"P. Frankl, Z. F\u00f6uredi: Exact solution of some Tur\u00e1n-type problems, J. Combin. Th. Ser. A 45 (1987), 226\u2013262.","journal-title":"J. Combin. Th. Ser. A"},{"key":"2838_CR11","doi-asserted-by":"crossref","first-page":"1415","DOI":"10.1016\/j.disc.2007.07.074","volume":"308","author":"P Frankl","year":"2008","unstructured":"P. Frankl, G. Y. Katona: Extremal k-edge Hamiltonian hypergraphs, Discrete Math. 308 (2008), 1415\u20131424.","journal-title":"Discrete Math."},{"key":"2838_CR12","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(83)90081-X","volume":"47","author":"Z F\u00f6uredi","year":"1983","unstructured":"Z. F\u00f6uredi: On finite set-systems whose every intersection is a kernel of a star, Discrete Math. 47 (1983), 129\u2013132.","journal-title":"Discrete Math."},{"key":"2838_CR13","first-page":"253","volume":"166","author":"Z F\u00f6uredi","year":"1991","unstructured":"Z. F\u00f6uredi: Tur\u00e1n type problems, Surveys in Combinatorics, London Math. Soc. Lecture Note Ser. 166, Cambridge Univ. Press, Cambridge, 1991, 253\u2013300.","journal-title":"Surveys in Combinatorics"},{"key":"2838_CR14","volume-title":"Linear paths and trees in uniform hypergraphs","author":"Z F\u00f6uredi","year":"2011","unstructured":"Z. F\u00f6uredi: Linear paths and trees in uniform hypergraphs, 2011."},{"key":"2838_CR15","doi-asserted-by":"crossref","first-page":"2246","DOI":"10.1016\/j.jcta.2011.05.002","volume":"118","author":"Z F\u00f6uredi","year":"2011","unstructured":"Z. F\u00f6uredi, L. \u00d6zkahya: Unavoidable subhypergraphs: a-clusters, J. Combin. Th. Ser. A 118 (2011), 2246\u20132256.","journal-title":"J. Combin. Th. Ser. A"},{"key":"2838_CR16","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/j.endm.2010.05.083","volume":"36","author":"E Gy\u0151ri","year":"2010","unstructured":"E. Gy\u0151ri, G.Y. Katona, N. Lemons: Hypergraph extensions of the Er\u0151s-Gallai theorem, Electronic Notes in Disc. Math. 36 (2010), 655\u2013662.","journal-title":"Electronic Notes in Disc. Math."},{"key":"2838_CR17","doi-asserted-by":"crossref","first-page":"1038","DOI":"10.1137\/090760775","volume":"24","author":"T Jiang","year":"2010","unstructured":"T. Jiang, O. Pikhurko, Z. Yilma: Set-systems without a strong simplex, SIAM J. Discrete Math. 24 (2010), 1038\u20131045.","journal-title":"SIAM J. Discrete Math."},{"key":"2838_CR18","unstructured":"T. Jiang, R. Siever: Hypergraph Tur\u00e1n numbers of loose paths, manuscript."},{"key":"2838_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/(SICI)1097-0118(199903)30:3<205::AID-JGT5>3.0.CO;2-O","volume":"30","author":"G Y Katona","year":"1999","unstructured":"G. Y. Katona, H. A. Kierstead: Hamiltonian chains in hypergraphs, J. Graph Theory 30 (1999), 205\u2013212.","journal-title":"J. Graph Theory"},{"key":"2838_CR20","volume-title":"Surveys in Combinatorics","author":"P Keevash","year":"2011","unstructured":"P. Keevash: Hypergraph Turan problems, Surveys in Combinatorics 2011, to appear."},{"key":"2838_CR21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.jctb.2004.05.003","volume":"92","author":"P Keevash","year":"2004","unstructured":"P. Keevash, D. Mubayi: Stability theorems for cancellative hypergraphs, J. Combin. Th. Ser B 92 (2004), 163\u2013175.","journal-title":"J. Combin. Th. Ser B"},{"key":"2838_CR22","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1137\/050647372","volume":"20","author":"P Keevash","year":"2006","unstructured":"P. Keevash, D. Mubayi, R. M. Wilson: Set systems with no singleton intersection, SIAM J. Discrete Math. 20 (2006), 1031\u20131041.","journal-title":"SIAM J. Discrete Math."},{"key":"2838_CR23","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1016\/j.jctb.2006.02.004","volume":"96","author":"D K\u00f6uhn","year":"2006","unstructured":"D. K\u00f6uhn, D. Osthus: Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree, J. Combin. Theory Ser. B 96 (2006), 767\u2013821.","journal-title":"J. Combin. Theory Ser. B"},{"key":"2838_CR24","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.jctb.2005.06.013","volume":"96","author":"D Mubayi","year":"2006","unstructured":"D. Mubayi: A hypergraph extension of Tur\u00e1n\u2019s theorem, J. Combin. Th. Ser. B 96 (2006), 122\u2013134.","journal-title":"J. Combin. Th. Ser. B"},{"key":"2838_CR25","doi-asserted-by":"crossref","first-page":"1681","DOI":"10.1016\/j.ejc.2006.07.001","volume":"28","author":"D Mubayi","year":"2007","unstructured":"D. Mubayi, J. Verstra\u00f6ete: Minimal paths and cycles in set systems, European J. Combin. 28 (2007), 1681\u20131693.","journal-title":"European J. Combin."},{"key":"2838_CR26","unstructured":"O. Pikhurko: Exact computation of the hypergraph Tur\u00e1n function for expanded complete 2-graph, accepted by J. Combin. Th. Ser. B, publication suspended for an indefinite time, see http:\/\/www.math.cmu.edu\/pikhurko\/Copyright.html ."},{"key":"2838_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V R\u00f6dl","year":"1985","unstructured":"V. R\u00f6dl: On a packing and covering problem, European J. of Combinatorics 6 (1985), 69\u201378.","journal-title":"European J. of Combinatorics"},{"key":"2838_CR28","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s00493-008-2295-z","volume":"28","author":"V R\u00f6dl","year":"2008","unstructured":"V. R\u00f6dl, A. Ruci\u0144ski, E. Szemer\u00e9di: An approximate Dirac-type theorem for k-uniform hypergaphs, Combinatorica 28 (2008), 229\u2013260.","journal-title":"Combinatorica"},{"key":"2838_CR29","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF02124681","volume":"9","author":"A F Sidorenko","year":"1989","unstructured":"A. F. Sidorenko: Asymptotic solution for a new class of forbidden r-graphs, Combinatorica 9 (1989), 207\u2013215.","journal-title":"Combinatorica"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2838-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-014-2838-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-014-2838-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:32:50Z","timestamp":1559093570000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-014-2838-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,8]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["2838"],"URL":"https:\/\/doi.org\/10.1007\/s00493-014-2838-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,8]]}}}