{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T01:45:25Z","timestamp":1777081525933,"version":"3.51.4"},"reference-count":66,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T00:00:00Z","timestamp":1737072000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003392","name":"Fujian Provincial Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003392","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series B"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1016\/j.jctb.2025.01.001","type":"journal-article","created":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T15:59:46Z","timestamp":1737647986000},"page":"221-262","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"special_numbering":"C","title":["Toward a density Corr\u00e1di\u2013Hajnal theorem for degenerate hypergraphs"],"prefix":"10.1016","volume":"172","author":[{"given":"Jianfeng","family":"Hou","sequence":"first","affiliation":[]},{"given":"Caiyun","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Heng","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0731-8084","authenticated-orcid":false,"given":"Xizhi","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Caihong","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Yixiao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jctb.2025.01.001_br0010","author":"Aharoni"},{"issue":"4","key":"10.1016\/j.jctb.2025.01.001_br0020","doi-asserted-by":"crossref","first-page":"721","DOI":"10.4153\/CJM-2014-030-6","article-title":"A density Corr\u00e1di-Hajnal theorem","volume":"67","author":"Allen","year":"2015","journal-title":"Can. J. Math."},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0030","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1006\/jctb.1996.0020","article-title":"H-factors in dense graphs","volume":"66","author":"Alon","year":"1996","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jctb.2025.01.001_br0040","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(74)90105-8","article-title":"Three-graphs without two triples whose symmetric difference is contained in a third","volume":"8","author":"Bollob\u00e1s","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0050","doi-asserted-by":"crossref","first-page":"281","DOI":"10.4153\/CMB-1966-036-2","article-title":"On graphs that do not contain a Thomsen graph","volume":"9","author":"Brown","year":"1966","journal-title":"Can. Math. Bull."},{"key":"10.1016\/j.jctb.2025.01.001_br0060","author":"Chen"},{"key":"10.1016\/j.jctb.2025.01.001_br0070","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","article-title":"On the maximal number of independent circuits in a graph","volume":"14","author":"Corr\u00e1di","year":"1963","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.jctb.2025.01.001_br0080","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/BF01650069","article-title":"\u00dcber ein Extremalproblem in der Graphentheorie","volume":"13","author":"Erd\u0151s","year":"1962","journal-title":"Arch. Math. (Basel)"},{"key":"10.1016\/j.jctb.2025.01.001_br0090","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02759942","article-title":"On extremal problems of graphs and generalized graphs","volume":"2","author":"Erd\u0151s","year":"1964","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0100","first-page":"93","article-title":"A problem on independent r-tuples","volume":"8","author":"Erd\u0151s","year":"1965","journal-title":"Ann. Univ. Sci. Budapest. E\u00f6tv\u00f6s Sect. Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0110","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.jctb.2025.01.001_br0120","first-page":"623","article-title":"On a problem in the theory of graphs","volume":"7","author":"Erd\u0151s","year":"1962","journal-title":"Magy. Tud. Akad. Mat. Kut. Int\u00e9z. K\u00f6zl."},{"key":"10.1016\/j.jctb.2025.01.001_br0130","first-page":"215","article-title":"On a problem of graph theory","volume":"1","author":"Erd\u0151s","year":"1966","journal-title":"Studia Sci. Math. Hung."},{"key":"10.1016\/j.jctb.2025.01.001_br0140","first-page":"51","article-title":"A limit theorem in graph theory","volume":"1","author":"Erd\u0151s","year":"1966","journal-title":"Studia Sci. Math. Hung."},{"key":"10.1016\/j.jctb.2025.01.001_br0150","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1090\/S0002-9904-1946-08715-7","article-title":"On the structure of linear graphs","volume":"52","author":"Erd\u0151s","year":"1946","journal-title":"Bull. Am. Math. Soc."},{"issue":"5","key":"10.1016\/j.jctb.2025.01.001_br0160","doi-asserted-by":"crossref","first-page":"1068","DOI":"10.1016\/j.jcta.2013.01.008","article-title":"Improved bounds for Erd\u0151s' matching conjecture","volume":"120","author":"Frankl","year":"2013","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"part 3","key":"10.1016\/j.jctb.2025.01.001_br0170","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/j.dam.2016.08.003","article-title":"On the maximum number of edges in a hypergraph with given matching number","volume":"216","author":"Frankl","year":"2017","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"10.1016\/j.jctb.2025.01.001_br0180","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/s11856-017-1595-7","article-title":"Proof of the Erd\u0151s matching conjecture in a new range","volume":"222","author":"Frankl","year":"2017","journal-title":"Isr. J. Math."},{"issue":"3\u20134","key":"10.1016\/j.jctb.2025.01.001_br0190","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF02579190","article-title":"A new generalization of the Erd\u0151s-Ko-Rado theorem","volume":"3","author":"Frankl","year":"1983","journal-title":"Combinatorica"},{"issue":"2\u20133","key":"10.1016\/j.jctb.2025.01.001_br0200","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(84)90058-X","article-title":"An exact result for 3-graphs","volume":"50","author":"Frankl","year":"1984","journal-title":"Discrete Math."},{"issue":"1","key":"10.1016\/j.jctb.2025.01.001_br0210","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0097-3165(89)90067-8","article-title":"Extremal problems whose solutions are the blowups of the small Witt-designs","volume":"52","author":"Frankl","year":"1989","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0220","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0095-8956(83)90018-7","article-title":"Graphs without quadrilaterals","volume":"34","author":"F\u00fcredi","year":"1983","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jctb.2025.01.001_br0230","unstructured":"Z. F\u00fcredi, Quadrilateral-free graphs with maximum number of edges, preprint, 1994."},{"issue":"1","key":"10.1016\/j.jctb.2025.01.001_br0240","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jctb.1996.0052","article-title":"On the number of edges of quadrilateral-free graphs","volume":"68","author":"F\u00fcredi","year":"1996","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jctb.2025.01.001_br0250","series-title":"Erd\u0151s Centennial","first-page":"169","article-title":"The history of degenerate (bipartite) extremal graph problems","volume":"vol. 25","author":"F\u00fcredi","year":"2013"},{"issue":"3","key":"10.1016\/j.jctb.2025.01.001_br0260","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1002\/jgt.22988","article-title":"Large Yk,b-tilings and Hamilton \u2113-cycles in k-uniform hypergraphs","volume":"104","author":"Gan","year":"2023","journal-title":"J. Graph Theory"},{"issue":"11","key":"10.1016\/j.jctb.2025.01.001_br0270","doi-asserted-by":"crossref","first-page":"2423","DOI":"10.1007\/s11425-020-1890-4","article-title":"On the rainbow matching conjecture for 3-uniform hypergraphs","volume":"65","author":"Gao","year":"2022","journal-title":"Sci. China Math."},{"issue":"5","key":"10.1016\/j.jctb.2025.01.001_br0280","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/j.ejc.2011.09.026","article-title":"The extremal function for partial bipartite tilings","volume":"33","author":"Grosu","year":"2012","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2025.01.001_br0290","series-title":"Combinatorial Theory and Its Applications, I-III","first-page":"601","article-title":"Proof of a conjecture of P. Erd\u0151s","author":"Hajnal","year":"1970"},{"key":"10.1016\/j.jctb.2025.01.001_br0300","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2024.103976","article-title":"Large Y3,2-tilings in 3-uniform hypergraphs","volume":"120","author":"Han","year":"2024","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2025.01.001_br0310","author":"Hou"},{"key":"10.1016\/j.jctb.2025.01.001_br0320","author":"Hou"},{"issue":"34","key":"10.1016\/j.jctb.2025.01.001_br0330","article-title":"Hypergraphs with infinitely many extremal constructions","author":"Hou","year":"2023","journal-title":"Discrete Anal."},{"key":"10.1016\/j.jctb.2025.01.001_br0340","author":"Hou"},{"issue":"3","key":"10.1016\/j.jctb.2025.01.001_br0350","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1017\/S096354831100068X","article-title":"The size of a hypergraph and its matching number","volume":"21","author":"Huang","year":"2012","journal-title":"Comb. Probab. Comput."},{"key":"10.1016\/j.jctb.2025.01.001_br0360","series-title":"Theory of Graphs","first-page":"187","article-title":"A theorem of finite sets","author":"Katona","year":"1968"},{"key":"10.1016\/j.jctb.2025.01.001_br0370","first-page":"228","article-title":"On a problem of Tur\u00e1n in the theory of graphs","volume":"15","author":"Katona","year":"1964","journal-title":"Mat. Lapok"},{"key":"10.1016\/j.jctb.2025.01.001_br0380","series-title":"Surveys in Combinatorics 2011","first-page":"83","article-title":"Hypergraph Tur\u00e1n problems","volume":"vol. 392","author":"Keevash","year":"2011"},{"issue":"1","key":"10.1016\/j.jctb.2025.01.001_br0390","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.jctb.2004.05.003","article-title":"Stability theorems for cancellative hypergraphs","volume":"92","author":"Keevash","year":"2004","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0400","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1112\/blms.12423","article-title":"Rainbow matchings in k-partite hypergraphs","volume":"53","author":"Kiselev","year":"2021","journal-title":"Bull. Lond. Math. Soc."},{"key":"10.1016\/j.jctb.2025.01.001_br0410","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0012-365X(00)00279-X","article-title":"Proof of the Alon-Yuster conjecture","volume":"235","author":"Koml\u00f3s","year":"2001","journal-title":"Discrete Math."},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0420","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1137\/140977138","article-title":"Tur\u00e1n problems and shadows iii: expansions of graphs","volume":"29","author":"Kostochka","year":"2015","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0430","doi-asserted-by":"crossref","first-page":"50","DOI":"10.4064\/cm-3-1-50-57","article-title":"On a problem of K. Zarankiewicz","volume":"3","author":"K\u00f6vari","year":"1954","journal-title":"Colloq. Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0440","series-title":"Mathematical Optimization Techniques","first-page":"251","article-title":"The number of simplices in a complex","author":"Kruskal","year":"1963"},{"key":"10.1016\/j.jctb.2025.01.001_br0450","series-title":"Surveys in Combinatorics 2009","first-page":"137","article-title":"Embedding large subgraphs into dense graphs","volume":"vol. 365","author":"K\u00fchn","year":"2009"},{"key":"10.1016\/j.jctb.2025.01.001_br0460","author":"Lang"},{"key":"10.1016\/j.jctb.2025.01.001_br0470","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2021.103350","article-title":"New short proofs to some stability theorems","volume":"96","author":"Liu","year":"2021","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2025.01.001_br0480","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.jctb.2024.03.006","article-title":"Cancellative hypergraphs and Steiner triple systems","volume":"167","author":"Liu","year":"2024","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jctb.2025.01.001_br0490","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.jctb.2020.12.004","article-title":"The feasible region of hypergraphs","volume":"148","author":"Liu","year":"2021","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jctb.2025.01.001_br0500","author":"Liu"},{"issue":"part 2","key":"10.1016\/j.jctb.2025.01.001_br0510","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.jctb.2022.08.008","article-title":"A unified approach to hypergraph stability","volume":"158","author":"Liu","year":"2023","journal-title":"J. Comb. Theory, Ser. B"},{"key":"10.1016\/j.jctb.2025.01.001_br0520","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2022.103666","article-title":"Stability theorems for some Kruskal-Katona type results","volume":"110","author":"Liu","year":"2023","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jctb.2025.01.001_br0530","author":"Liu"},{"issue":"3","key":"10.1016\/j.jctb.2025.01.001_br0540","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1137\/21M1442383","article-title":"Rainbow perfect matchings for 4-uniform hypergraphs","volume":"36","author":"Lu","year":"2022","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0550","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2022.105700","article-title":"A better bound on the size of rainbow matchings","volume":"195","author":"Lu","year":"2023","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"1","key":"10.1016\/j.jctb.2025.01.001_br0560","article-title":"Using Lov\u00e1sz local lemma in the space of random injections","volume":"14","author":"Lu","year":"2007","journal-title":"Electron. J. Comb."},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0570","first-page":"60","article-title":"Vraagstuk XXVIII","volume":"10","author":"Mantel","year":"1907","journal-title":"Wiskd. Opgaven"},{"key":"10.1016\/j.jctb.2025.01.001_br0580","doi-asserted-by":"crossref","first-page":"95","DOI":"10.4153\/CJM-1968-012-x","article-title":"On independent complete subgraphs in a graph","volume":"20","author":"Moon","year":"1968","journal-title":"Can. J. Math."},{"key":"10.1016\/j.jctb.2025.01.001_br0590","article-title":"On hypergraphs with every four points spanning at most two triples","volume":"10","author":"Mubayi","year":"2003","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.jctb.2025.01.001_br0600","series-title":"AIM Workshop Problem Lists, Manuscript","first-page":"166","article-title":"Hypergraph Tur\u00e1n problem: some open questions","author":"Mubayi","year":"2011"},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0610","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/jgt.20251","article-title":"On the independence number of the Erd\u0151s-R\u00e9nyi and projective norm graphs and a related hypergraph","volume":"56","author":"Mubayi","year":"2007","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.jctb.2025.01.001_br0620","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.jcta.2016.09.003","article-title":"Tur\u00e1n number of generalized triangles","volume":"146","author":"Norin","year":"2017","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"2","key":"10.1016\/j.jctb.2025.01.001_br0630","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s00493-008-2187-2","article-title":"An exact Tur\u00e1n result for the generalized triangle","volume":"28","author":"Pikhurko","year":"2008","journal-title":"Combinatorica"},{"issue":"1","key":"10.1016\/j.jctb.2025.01.001_br0640","article-title":"A new construction for cancellative families of sets","volume":"3","author":"Shearer","year":"1996","journal-title":"Electron. J. Comb."},{"issue":"3","key":"10.1016\/j.jctb.2025.01.001_br0650","first-page":"433","article-title":"On the maximal number of edges in a homogeneous hypergraph that does not contain prohibited subgraphs","volume":"41","author":"Sidorenko","year":"1987","journal-title":"Mat. Zametki"},{"key":"10.1016\/j.jctb.2025.01.001_br0660","series-title":"Theory of Graphs","first-page":"279","article-title":"A method for solving extremal problems in graph theory, stability problems","author":"Simonovits","year":"1968"}],"container-title":["Journal of Combinatorial Theory, Series B"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895625000048?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0095895625000048?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T17:33:34Z","timestamp":1741368814000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0095895625000048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":66,"alternative-id":["S0095895625000048"],"URL":"https:\/\/doi.org\/10.1016\/j.jctb.2025.01.001","relation":{},"ISSN":["0095-8956"],"issn-type":[{"value":"0095-8956","type":"print"}],"subject":[],"published":{"date-parts":[[2025,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Toward a density Corr\u00e1di\u2013Hajnal theorem for degenerate hypergraphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series B","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jctb.2025.01.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}