{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T05:51:23Z","timestamp":1775022683928,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T00:00:00Z","timestamp":1709251200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003827","name":"Nemzeti Kutatasi Fejlesztesi es Innovacios Hivatal","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003827","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012550","name":"Nemzeti Kutat\u00e1si, Fejleszt\u00e9si \u00e9s Innovaci\u00f3s Alap","doi-asserted-by":"publisher","award":["KH129597"],"award-info":[{"award-number":["KH129597"]}],"id":[{"id":"10.13039\/501100012550","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Office","doi-asserted-by":"publisher","award":["K126853"],"award-info":[{"award-number":["K126853"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Office","doi-asserted-by":"publisher","award":["K132696"],"award-info":[{"award-number":["K132696"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018818","name":"National Research, Development and Innovation Office","doi-asserted-by":"publisher","award":["TKP2021-NVA-09"],"award-info":[{"award-number":["TKP2021-NVA-09"]}],"id":[{"id":"10.13039\/501100018818","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1016\/j.disc.2023.113828","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T13:46:20Z","timestamp":1701956780000},"page":"113828","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":5,"title":["Book free 3-uniform hypergraphs"],"prefix":"10.1016","volume":"347","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4384-695X","authenticated-orcid":false,"given":"Debarun","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5691-2242","authenticated-orcid":false,"given":"Ervin","family":"Gy\u0151ri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5550-6904","authenticated-orcid":false,"given":"Judit","family":"Nagy-Gy\u00f6rgy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Addisu","family":"Paulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9521-6338","authenticated-orcid":false,"given":"Chuanqi","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Zamora","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.disc.2023.113828_br0010","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1016\/j.disc.2019.01.011","article-title":"A note on Ramsey numbers for Berge-G hypergraphs","volume":"342","author":"Axenovich","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2023.113828_br0020","series-title":"Proceedings of the Fifth British Combinatorial Conference","first-page":"678","article-title":"Unsolved problems","author":"Bollob\u00e1s","year":"1975"},{"issue":"19","key":"10.1016\/j.disc.2023.113828_br0030","doi-asserted-by":"crossref","first-page":"4332","DOI":"10.1016\/j.disc.2007.08.016","article-title":"Pentagons vs. triangles","volume":"308","author":"Bollob\u00e1s","year":"2008","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2023.113828_br0040","unstructured":"C. Edwards, A lower bound for the largest number of triangles with a common edge, Unpublished manuscript, 1977."},{"key":"10.1016\/j.disc.2023.113828_br0050","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF02024498","article-title":"On maximal paths and circuits of graphs","volume":"10","author":"Erd\u0151s","year":"1959","journal-title":"Acta Math. Hung."},{"key":"10.1016\/j.disc.2023.113828_br0060","first-page":"13","article-title":"Some theorems on graphs","volume":"9","author":"Erd\u0151s","year":"1955","journal-title":"Riveon Lematematika"},{"issue":"1","key":"10.1016\/j.disc.2023.113828_br0070","first-page":"122","article-title":"On a theorem of Rademacher-Tur\u00e1n","volume":"6","author":"Erd\u0151s","year":"1962","journal-title":"Ill. J. Math."},{"issue":"1\u20132","key":"10.1016\/j.disc.2023.113828_br0080","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1017\/S0963548305007108","article-title":"Triangle-free hypergraphs","volume":"15","author":"Gy\u0151ri","year":"2006","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2023.113828_br0090","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/j.ejc.2016.05.012","article-title":"Hypergraph extensions of the Erd\u0151s-Gallai theorem","volume":"58","author":"Gy\u0151ri","year":"2016","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2023.113828_br0100","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.jctb.2018.04.004","article-title":"Cycles of given lengths in hypergraphs","volume":"133","author":"Jiang","year":"2018","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2023.113828_br0110","first-page":"1315","article-title":"Solution of a problem of P. Erd\u0151s about the maximum number of triangles with a common edge in a graph","volume":"32","author":"Khad\u017aiivanov","year":"1979","journal-title":"C. R. Acad. Bulgare Sci."},{"key":"10.1016\/j.disc.2023.113828_br0120","article-title":"On hypergraphs of girth five","volume":"10","author":"Lazebnik","year":"2003","journal-title":"Electron. J. Comb."},{"issue":"10","key":"10.1016\/j.disc.2023.113828_br0130","first-page":"60","article-title":"Problem 28","volume":"10","author":"Mantel","year":"1907","journal-title":"Wiskundige Opgaven"},{"key":"10.1016\/j.disc.2023.113828_br0140","first-page":"1","article-title":"On a problem of Erd\u0151s about graphs whose size is the Tur\u00e1n number plus one","author":"Qiao","year":"2021","journal-title":"Bull. Aust. Math. Soc."},{"key":"10.1016\/j.disc.2023.113828_br0150","first-page":"939","article-title":"Triple systems with no six points carrying three triangles","volume":"18","author":"Ruzsa","year":"1978","journal-title":"Colloq. Math. Soc. J\u00e1nos Bolyai"},{"key":"10.1016\/j.disc.2023.113828_br0160","article-title":"The Tur\u00e1n number of book graphs","volume":"39","author":"Yan","year":"2023","journal-title":"Indian J. Pure Appl. Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X23005149?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X23005149?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T22:55:00Z","timestamp":1762124100000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X23005149"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["S0012365X23005149"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2023.113828","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2024,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Book free 3-uniform hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2023.113828","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"113828"}}