{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:15:47Z","timestamp":1759335347578,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,5,28]],"date-time":"2018-05-28T00:00:00Z","timestamp":1527465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1900-1","type":"journal-article","created":{"date-parts":[[2018,5,27]],"date-time":"2018-05-27T22:40:00Z","timestamp":1527460800000},"page":"619-632","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tur\u00e1n Numbers of Complete 3-Uniform Berge-Hypergraphs"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1684-0229","authenticated-orcid":false,"given":"L.","family":"Maherani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Shahsiah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,28]]},"reference":[{"key":"1900_CR1","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":"1900_CR2","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. Combin. Theory Ser. A 123, 252\u2013270 (2014)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1900_CR3","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.: On Exact solution of the hypergraph Tur\u00e1n problem for \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -uniform linear paths. Combinatorica 34, 299\u2013322 (2014)","journal-title":"Combinatorica"},{"key":"1900_CR4","unstructured":"F\u00fcredi, Z., \u00d6zkahya, L.: On 3-uniform hypergraphs without a cycle of a given length. \n                    arXiv:1412.8083v2"},{"key":"1900_CR5","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ejc.2016.05.012","volume":"58","author":"E Gy\u0151ri","year":"2016","unstructured":"Gy\u0151ri, E., Katona, G.Y., Lemons, N.: Hypergraph extensions of the Erd\u0151s\u2013Gallai theorem. Eur. J. Combin. 58, 238\u2013246 (2016)","journal-title":"Eur. J. Combin."},{"key":"1900_CR6","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1017\/S0963548311000691","volume":"21","author":"E Gy\u0151ri","year":"2012","unstructured":"Gy\u0151ri, E., Lemons, N.: Hypergraphs with no cycle of a given length. Combin. Probab. Comput. 21, 193\u2013201 (2012)","journal-title":"Combin. Probab. Comput."},{"key":"1900_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s00493-012-2584-4","volume":"32","author":"E Gy\u0151ri","year":"2012","unstructured":"Gy\u0151ri, E., Lemons, N.: 3-uniform hypergraphs avoiding a given odd cycle. Combinatorica 32, 187\u2013203 (2012)","journal-title":"Combinatorica"},{"key":"1900_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"10","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. 10, 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"key":"1900_CR9","doi-asserted-by":"crossref","unstructured":"Keevash, P.: Hypergraph Tur\u00e1n problems. In: Surveys in Combinatorics 2011. Cambridge University Press, Cambridge, pp. 83\u2013140 (2011)","DOI":"10.1017\/CBO9781139004114.004"},{"key":"1900_CR10","doi-asserted-by":"publisher","first-page":"167","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. Combin. Theory Ser. A 129, 167\u2013190 (2015)","journal-title":"J. Combin. Theory Ser. A"},{"key":"1900_CR11","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jctb.2005.06.013","volume":"96","author":"D Mubayi","year":"2006","unstructured":"Mubayi, D.: A hypergraph extension of Tur\u00e1n\u2019s theorem. J. Combin. Theory Ser. B 96, 122\u2013134 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1900_CR12","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jctb.2012.09.005","volume":"103","author":"O Pikhurko","year":"2013","unstructured":"Pikhurko, O.: Exact computation of the hypergraph Tur\u00e1n function for expanded complete 2-graphs. J. Combin. Theory Ser. B 103, 220\u2013225 (2013)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1900_CR13","first-page":"436","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436\u2013452 (1941)","journal-title":"Mat. Fiz. Lapok"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1900-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1900-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1900-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:23:48Z","timestamp":1558985028000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1900-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,28]]},"references-count":13,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1900"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1900-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,5,28]]},"assertion":[{"value":"6 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}