{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T15:33:01Z","timestamp":1768750381623,"version":"3.49.0"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"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":[[2012,3]]},"DOI":"10.1007\/s00493-012-2584-4","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T18:48:05Z","timestamp":1338922085000},"page":"187-203","source":"Crossref","is-referenced-by-count":28,"title":["3-uniform hypergraphs avoiding a given odd cycle"],"prefix":"10.1007","volume":"32","author":[{"given":"Ervin","family":"Gy\u0151ri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nathan","family":"Lemons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"key":"2584_CR1","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s: Modern Graph Theory, Springer, 1998.","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"2584_CR2","doi-asserted-by":"crossref","first-page":"4332","DOI":"10.1016\/j.disc.2007.08.016","volume":"308","author":"B. Bollob\u00e1s","year":"2008","unstructured":"B. Bollob\u00e1s, E. Gy\u0151ri: Pentagons vs. triangles, Discrete Math. 308 (2008), 4332\u20134336.","journal-title":"Discrete Math"},{"key":"2584_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0095-8956(74)90052-5","volume":"16","author":"J.A. Bondy","year":"1974","unstructured":"J.A. Bondy and M. Simonovits: Cycles of even length in graphs, J. Combin. Theory B 16 (1974), 97\u2013105.","journal-title":"J. Combin. Theory B"},{"key":"2584_CR4","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","volume":"10","author":"P. Erd\u0151s","year":"1959","unstructured":"P. Erd\u0151s and 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":"2584_CR5","first-page":"51","volume":"1","author":"P. Erd\u0151s","year":"1966","unstructured":"P. Erd\u0151s and M. Simonovits: A limit theorem in graph theory, Studia Sci. Math. Hungar. 1 (1966), 51\u201357.","journal-title":"Studia Sci. Math. Hungar"},{"key":"2584_CR6","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","volume":"52","author":"P. Erd\u0151s","year":"1946","unstructured":"P. Erd\u0151s and A.M. Stone: On the structure of linear graphs, Bull. Amer. Math. Soc. 52 (1946), 1087\u20131091.","journal-title":"Bull. Amer. Math. Soc"},{"key":"2584_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1017\/S0963548305007108","volume":"15","author":"E. Gy\u0151ri","year":"2006","unstructured":"E. Gy\u0151ri: Triangle-free hypergraphs, Combinatorics, Probability and Computing 15 (2006), 185\u2013191.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2584_CR8","unstructured":"E. Gy\u0151ri and H. Li: A note on the number of triangles in C 2k+1-free graphs, submitted to J. Combin. Theory B."},{"key":"2584_CR9","doi-asserted-by":"crossref","first-page":"15","DOI":"10.37236\/1718","volume":"10","author":"F. Lazebnik","year":"2003","unstructured":"F. Lazebnik, J. Verstra\u00ebte: On hypergraphs of girth five, Electronic J. Combinatorics 10 (2003), 15 (Research Paper 25).","journal-title":"Electronic J. Combinatorics"},{"key":"2584_CR10","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","volume":"39","author":"C. St. J. A. Nash-Williams","year":"1964","unstructured":"C. St. J. A. Nash-Williams: Decomposition of finite graphs into forests, J. London Math. Soc. 39 (1964), 12.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2584-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-012-2584-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-012-2584-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T11:19:32Z","timestamp":1594207172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-012-2584-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["2584"],"URL":"https:\/\/doi.org\/10.1007\/s00493-012-2584-4","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3]]}}}