{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T17:04:48Z","timestamp":1780679088684,"version":"3.54.1"},"reference-count":29,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2023YFA1010200"],"award-info":[{"award-number":["2023YFA1010200"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2020YFA0713100"],"award-info":[{"award-number":["2020YFA0713100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018537","name":"National Science and Technology Major Project","doi-asserted-by":"publisher","award":["2021ZD0302902"],"award-info":[{"award-number":["2021ZD0302902"]}],"id":[{"id":"10.13039\/501100018537","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171452"],"award-info":[{"award-number":["12171452"]}],"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":["12231014"],"award-info":[{"award-number":["12231014"]}],"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":["12571352"],"award-info":[{"award-number":["12571352"]}],"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":["2021ZD0302902"],"award-info":[{"award-number":["2021ZD0302902"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Combinatorial Theory, Series A"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.jcta.2026.106193","type":"journal-article","created":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T07:49:44Z","timestamp":1774338584000},"page":"106193","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Focal-free uniform hypergraphs and codes"],"prefix":"10.1016","volume":"223","author":[{"given":"Xinqi","family":"Huang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chong","family":"Shangguan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4234-3610","authenticated-orcid":false,"given":"Xiande","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuhao","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.jcta.2026.106193_br0010","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11856-023-2500-1","article-title":"Near-sunflowers and focal families","volume":"256","author":"Alon","year":"2023","journal-title":"Isr. J. Math."},{"key":"10.1016\/j.jcta.2026.106193_br0020","series-title":"2012 IEEE 27th Conference on Computational Complexity","first-page":"214","article-title":"On sunflowers and matrix multiplication","author":"Alon","year":"2012"},{"issue":"1","key":"10.1016\/j.jcta.2026.106193_br0030","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/rsa.3240060103","article-title":"Disjoint systems","volume":"6","author":"Alon","year":"1995","journal-title":"Random Struct. Algorithms"},{"issue":"3","key":"10.1016\/j.jcta.2026.106193_br0040","doi-asserted-by":"crossref","first-page":"795","DOI":"10.4007\/annals.2021.194.3.5","article-title":"Improved bounds for the sunflower lemma","volume":"194","author":"Alweiss","year":"2021","journal-title":"Ann. Math."},{"issue":"7","key":"10.1016\/j.jcta.2026.106193_br0050","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2021.112367","article-title":"Note on sunflowers","volume":"344","author":"Bell","year":"2021","journal-title":"Discrete Math."},{"issue":"3","key":"10.1016\/j.jcta.2026.106193_br0060","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/S0895480101384633","article-title":"Frameproof codes","volume":"16","author":"Blackburn","year":"2003","journal-title":"SIAM J. Discrete Math."},{"issue":"8","key":"10.1016\/j.jcta.2026.106193_br0070","doi-asserted-by":"crossref","first-page":"5449","DOI":"10.1109\/TIT.2012.2197812","article-title":"Improved constructions of frameproof codes","volume":"58","author":"Chee","year":"2012","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106193_br0080","series-title":"The CRC Handbook of Combinatorial Designs","author":"Colbourn","year":"2007"},{"key":"10.1016\/j.jcta.2026.106193_br0090","author":"Delcourt"},{"issue":"1","key":"10.1016\/j.jcta.2026.106193_br0100","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1006\/jcta.1997.2778","article-title":"Intersection statements for systems of sets","volume":"79","author":"Deuber","year":"1997","journal-title":"J. Comb. Theory, Ser. A"},{"issue":"93\u201395","key":"10.1016\/j.jcta.2026.106193_br0110","first-page":"2","article-title":"A problem on independent r-tuples","volume":"8","author":"Erd\u0151s","year":"1965","journal-title":"Ann. Univ. Sci. Bp. Rolando E\u00f6tv\u00f6s Nomin., Sect. Math."},{"issue":"1\u20132","key":"10.1016\/j.jcta.2026.106193_br0120","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u0151s","year":"1985","journal-title":"Isr. J. Math."},{"issue":"1","key":"10.1016\/j.jcta.2026.106193_br0130","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","article-title":"Intersection theorems for systems of sets","volume":"1","author":"Erd\u0151s","year":"1960","journal-title":"J. Lond. Math. Soc."},{"issue":"3","key":"10.1016\/j.jcta.2026.106193_br0140","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/0097-3165(78)90060-2","article-title":"Combinatorial properties of systems of sets","volume":"24","author":"Erd\u0151s","year":"1978","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jcta.2026.106193_br0150","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/S0167-5060(08)70032-3","article-title":"A general intersection theorem for finite sets","volume":"9","author":"Frankl","year":"1980","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.jcta.2026.106193_br0160","first-page":"165","article-title":"Colored Packing of Sets","volume":"vol. 149","author":"Frankl","year":"1987"},{"key":"10.1016\/j.jcta.2026.106193_br0170","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/j.jctb.2022.08.002","article-title":"The Erd\u0151s matching conjecture and concentration inequalities","volume":"157","author":"Frankl","year":"2022","journal-title":"J. Comb. Theory, Ser. B"},{"issue":"4","key":"10.1016\/j.jcta.2026.106193_br0180","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0195-6698(85)80045-7","article-title":"Near perfect coverings in graphs and hypergraphs","volume":"6","author":"Frankl","year":"1985","journal-title":"Eur. J. Comb."},{"issue":"1406","key":"10.1016\/j.jcta.2026.106193_br0190","article-title":"The existence of designs via iterative absorption: hypergraph F-designs for arbitrary F","volume":"284","author":"Glock","year":"2023","journal-title":"Mem. Am. Math. Soc."},{"key":"10.1016\/j.jcta.2026.106193_br0200","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/s10474-018-0798-7","article-title":"An improved upper bound for the size of a sunflower-free family","volume":"155","author":"Heged\u0171s","year":"2018","journal-title":"Acta Math. Hung."},{"key":"10.1016\/j.jcta.2026.106193_br0210","series-title":"Extremal Combinatorics: with Applications in Computer Science, vol. 571","author":"Jukna","year":"2011"},{"key":"10.1016\/j.jcta.2026.106193_br0220","author":"Keevash"},{"issue":"6","key":"10.1016\/j.jcta.2026.106193_br0230","doi-asserted-by":"crossref","first-page":"4137","DOI":"10.1109\/TIT.2025.3558360","article-title":"Near optimal probabilistic constructions of frameproof codes","volume":"71","author":"Liu","year":"2025","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10.1016\/j.jcta.2026.106193_br0240","doi-asserted-by":"crossref","DOI":"10.1017\/fms.2017.12","article-title":"Upper bounds for sunflower-free sets","volume":"5","author":"Naslund","year":"2017","journal-title":"Forum Math. Sigma"},{"issue":"1","key":"10.1016\/j.jcta.2026.106193_br0250","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0097-3165(89)90074-5","article-title":"Asymptotic behavior of the chromatic index for hypergraphs","volume":"51","author":"Pippenger","year":"1989","journal-title":"J. Comb. Theory, Ser. A"},{"key":"10.1016\/j.jcta.2026.106193_br0260","article-title":"Coding for sunflowers","author":"Rao","year":"2020","journal-title":"Discrete Anal."},{"issue":"2","key":"10.1016\/j.jcta.2026.106193_br0270","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","article-title":"Polynomial codes over certain finite fields","volume":"8","author":"Reed","year":"1960","journal-title":"J. Soc. Ind. Appl. Math."},{"issue":"1","key":"10.1016\/j.jcta.2026.106193_br0280","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","article-title":"On a packing and covering problem","volume":"6","author":"R\u00f6dl","year":"1985","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.jcta.2026.106193_br0290","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcta.2020.105228","article-title":"Degenerate Tur\u00e1n densities of sparse hypergraphs","volume":"173","author":"Shangguan","year":"2020","journal-title":"J. Comb. Theory, Ser. A"}],"container-title":["Journal of Combinatorial Theory, Series A"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000361?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097316526000361?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T16:47:16Z","timestamp":1780678036000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097316526000361"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":29,"alternative-id":["S0097316526000361"],"URL":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106193","relation":{},"ISSN":["0097-3165"],"issn-type":[{"value":"0097-3165","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Focal-free uniform hypergraphs and codes","name":"articletitle","label":"Article Title"},{"value":"Journal of Combinatorial Theory, Series A","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcta.2026.106193","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"106193"}}