{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T14:03:06Z","timestamp":1765029786136,"version":"3.46.0"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1016\/j.ejc.2025.104286","type":"journal-article","created":{"date-parts":[[2025,11,21]],"date-time":"2025-11-21T17:09:32Z","timestamp":1763744972000},"page":"104286","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"PB","title":["Critically intersecting hypergraphs"],"prefix":"10.1016","volume":"132","author":[{"given":"P.","family":"Frankl","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2025.104286_b1","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.jcta.2016.11.001","article-title":"An upper bound for the size of a k-uniform intersecting family with covering number k","volume":"147","author":"Arman","year":"2017","journal-title":"J. Combin. Theory Ser. A"},{"year":"2011","series-title":"About maximal number of edges in hypergraph-clique with chromatic nurnber 3","author":"Cherkashin","key":"10.1016\/j.ejc.2025.104286_b2"},{"key":"10.1016\/j.ejc.2025.104286_b3","series-title":"Infinite and Finite Sets","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs","author":"Erd\u0151s","year":"1974"},{"key":"10.1016\/j.ejc.2025.104286_b4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548319000142","article-title":"A near exponential improvement on a bound of Erd\u0151s and Lov\u00e1sz","volume":"28","author":"Frankl","year":"2019","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2025.104286_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2022.103553","article-title":"Pseudo sunflowers","volume":"104","author":"Frankl","year":"2022","journal-title":"European J. Combin."},{"key":"10.1016\/j.ejc.2025.104286_b6","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1006\/jcta.1996.0035","article-title":"Covers in uniform intersecting families and a counterexample to a conjecture of Lov\u00e1sz","volume":"74","author":"Frankl","year":"1996","journal-title":"J. Comb. Theory A"},{"key":"10.1016\/j.ejc.2025.104286_b7","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/0097-3165(80)90071-0","article-title":"On maximal intersecting families of finite sets","volume":"28","author":"F\u00fcredi","year":"1980","journal-title":"J. Comb. Theory Ser. A"},{"key":"10.1016\/j.ejc.2025.104286_b8","first-page":"209","article-title":"On the minimax theorems of combinatorics","volume":"26","author":"Lov\u00e1sz","year":"1975","journal-title":"Mat. Lapok"},{"key":"10.1016\/j.ejc.2025.104286_b9","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1017\/S0963548323000287","article-title":"On the size of maximal intersecting families","volume":"33","author":"Zakharov","year":"2024","journal-title":"Comb. Prob. Comput."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669825001775?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669825001775?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T14:00:07Z","timestamp":1765029607000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669825001775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":9,"alternative-id":["S0195669825001775"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2025.104286","relation":{},"ISSN":["0195-6698"],"issn-type":[{"type":"print","value":"0195-6698"}],"subject":[],"published":{"date-parts":[[2026,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Critically intersecting hypergraphs","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2025.104286","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104286"}}