{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T13:15:47Z","timestamp":1778591747762,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12331012"],"award-info":[{"award-number":["12331012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571375"],"award-info":[{"award-number":["12571375"]}],"id":[{"id":"10.13039\/501100001809","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":[[2026,9]]},"DOI":"10.1016\/j.disc.2026.115152","type":"journal-article","created":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T15:52:06Z","timestamp":1774972326000},"page":"115152","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tur\u00e1n problem for Berge disjoint cycles in hypergraphs"],"prefix":"10.1016","volume":"349","author":[{"given":"Yuanpei","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7752-0392","authenticated-orcid":false,"given":"Liying","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.disc.2026.115152_br0010","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jctb.2016.03.004","article-title":"Many T copies in H-free graphs","volume":"121","author":"Alon","year":"2016","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115152_br0020","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ejc.2017.10.006","article-title":"An Erd\u0151s\u2013Gallai type theorem for uniform hypergraphs","volume":"69","author":"Davoodi","year":"2018","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115152_br0030","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. Acad. Sci. Hung."},{"key":"10.1016\/j.disc.2026.115152_br0040","series-title":"Theory of Graphs, Proceedings of the Colloquium Held at Tihany","first-page":"77","article-title":"On some new inequalities concerning extremal properties of graphs","author":"Erd\u0151s","year":"1966"},{"key":"10.1016\/j.disc.2026.115152_br0050","series-title":"Results, Theory of Graphs","first-page":"117","article-title":"Some recent results on extremal problems in graph theory","author":"Erd\u0151s","year":"1967"},{"key":"10.1016\/j.disc.2026.115152_br0060","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1002\/jgt.70001","article-title":"Counting cliques without generalized theta graphs","volume":"111","author":"Gao","year":"2026","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.disc.2026.115152_br0070","doi-asserted-by":"crossref","first-page":"2314","DOI":"10.1137\/16M1066191","article-title":"Extremal results for Berge hypergraphs","volume":"31","author":"Gerbner","year":"2017","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0080","series-title":"Extremal Finite Set Theory","author":"Gerbner","year":"2018"},{"key":"10.1016\/j.disc.2026.115152_br0090","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103001","article-title":"Counting copies of a fixed subgraph in F-free graphs","volume":"82","author":"Gerbner","year":"2019","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115152_br0100","doi-asserted-by":"crossref","first-page":"3130","DOI":"10.1016\/j.disc.2019.06.022","article-title":"Generalized Tur\u00e1n problems for disjoint copies of graphs","volume":"342","author":"Gerbner","year":"2019","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2020.103082","article-title":"General lemmas for Berge\u2013Tur\u00e1n hypergraph problems","volume":"86","author":"Gerbner","year":"2020","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115152_br0120","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s00373-024-02757-w","article-title":"On non-degenerate Berge\u2013Tur\u00e1n problems","volume":"40","author":"Gerbner","year":"2024","journal-title":"Graphs Comb."},{"key":"10.1016\/j.disc.2026.115152_br0130","doi-asserted-by":"crossref","first-page":"2896","DOI":"10.1137\/22M1474266","article-title":"The Tur\u00e1n number of Berge book hypergraphs","volume":"38","author":"Gerbner","year":"2024","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0140","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2023.113828","article-title":"Book free 3-uniform hypergraph","volume":"347","author":"Ghosh","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0150","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2020.103109","article-title":"Uniformity thresholds for the asymptotic size of extremal Berge-F-free hypergraphs","volume":"88","author":"Gr\u00f3sz","year":"2020","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115152_br0160","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1137\/18M1204048","article-title":"The Tur\u00e1n number of Berge K4 in triple systems","volume":"33","author":"Gy\u00e1rf\u00e1s","year":"2019","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0170","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1017\/S0963548311000691","article-title":"Hypergraphs with no cycle of a given length","volume":"21","author":"Gy\u0151ri","year":"2012","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.disc.2026.115152_br0180","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.2026.115152_br0190","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.jctb.2020.04.007","article-title":"The structure of hypergraphs without long Berge cycles","volume":"148","author":"Gy\u0151ri","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.disc.2026.115152_br0200","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2024.114015","article-title":"Counting triangles in graphs without vertex disjoint odd cycles","volume":"347","author":"Hou","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0210","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112901","article-title":"The Tur\u00e1n number of Berge-matching in hypergraphs","volume":"345","author":"Kang","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0220","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2022.103506","article-title":"Tur\u00e1n numbers for hypergraph star forests","volume":"102","author":"Khormali","year":"2022","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.disc.2026.115152_br0230","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0012-365X(74)90044-2","article-title":"Extremal graph problems with symmetrical extremal graphs. Additional chromatic conditions","volume":"7","author":"Simonovits","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0240","article-title":"Maximum cliques in a graph without disjoint given subgraph","volume":"347","author":"Zhang","year":"2024","journal-title":"Discrete Math."},{"key":"10.1016\/j.disc.2026.115152_br0250","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/20M1315269","article-title":"The Tur\u00e1n number of Berge-K4 in 3-uniform hypergraphs","volume":"34","author":"Zhu","year":"2020","journal-title":"SIAM J. Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001767?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X26001767?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:56:46Z","timestamp":1778590606000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X26001767"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":25,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["S0012365X26001767"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2026.115152","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tur\u00e1n problem for Berge disjoint cycles in hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disc.2026.115152","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115152"}}