{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T02:09:51Z","timestamp":1780106991619,"version":"3.54.0"},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation","doi-asserted-by":"publisher","award":["2025JJ30003"],"award-info":[{"award-number":["2025JJ30003"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12571363"],"award-info":[{"award-number":["12571363"]}],"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":["12371327"],"award-info":[{"award-number":["12371327"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.ejc.2026.104379","type":"journal-article","created":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:16:06Z","timestamp":1775096166000},"page":"104379","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Counting the maximum number of sunflowers in hypergraphs with given matching number"],"prefix":"10.1016","volume":"136","author":[{"given":"Wenkun","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yuejian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.ejc.2026.104379_b1","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.ejc.2026.104379_b2","article-title":"Hypergraph Tur\u00e1n problems in \u21132-norm, surveys in combinatorics 2022, 2163","volume":"vol. 481","author":"Balogh","year":"2022"},{"key":"10.1016\/j.ejc.2026.104379_b3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1093\/qmath\/27.1.25","article-title":"Sets of independent edges of a hypergraph","volume":"27","author":"Bollob\u00e1s","year":"1976","journal-title":"Quart. J. Math. Oxf. Ser."},{"key":"10.1016\/j.ejc.2026.104379_b4","unstructured":"G. Brooks, W. Linz, Some exact and asymptotic results for hypergraph Tur\u00e1n problems in \u21132-norm. arXiv:2310.09379."},{"key":"10.1016\/j.ejc.2026.104379_b5","first-page":"93","article-title":"A problem on independent t-tuples","volume":"8","author":"Erd\u0151s","year":"1965","journal-title":"Ann. Univ. Sci. Bp."},{"key":"10.1016\/j.ejc.2026.104379_b6","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.ejc.2026.104379_b7","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1093\/qmath\/12.1.313","article-title":"Intersection theorems for systems of finite sets","volume":"12","author":"Erd\u0151s","year":"1961","journal-title":"Q. J. Math."},{"key":"10.1016\/j.ejc.2026.104379_b8","first-page":"1293","article-title":"Extremal set systems","volume":"vol. 2","author":"Frankl","year":"1995"},{"key":"10.1016\/j.ejc.2026.104379_b9","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. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104379_b10","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."},{"key":"10.1016\/j.ejc.2026.104379_b11","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":"Israel J. Math."},{"key":"10.1016\/j.ejc.2026.104379_b12","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. Combin. Theory Ser. B"},{"key":"10.1016\/j.ejc.2026.104379_b13","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1017\/S0963548311000496","article-title":"On the maximum number of edges in a triple system not containing a disjoint family of a given size","volume":"21","author":"Frankl","year":"2012","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104379_b14","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":"Combin. Probab. Comput."},{"key":"10.1016\/j.ejc.2026.104379_b15","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.ejc.2018.05.001","article-title":"Lagrangian densities of some sparse hypergraphs and Tur\u00e1n numbers of their extensions","volume":"73","author":"Jiang","year":"2018","journal-title":"Eur. J. Comb."},{"key":"10.1016\/j.ejc.2026.104379_b16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0021-9800(68)80050-X","article-title":"Maximal number of subsets of a finite set no k of which are pairwise disjoint","volume":"5","author":"Kleitman","year":"1968","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.ejc.2026.104379_b17","article-title":"The maximum number of cliques in hypergraphs without large matchings","volume":"27","author":"Liu","year":"2020","journal-title":"Electron. J. Comb."},{"key":"10.1016\/j.ejc.2026.104379_b18","doi-asserted-by":"crossref","first-page":"19","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. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104379_b19","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/j.jcta.2014.01.003","article-title":"On Erd\u0151s\u2019 extremal problem on matchings in hypergraphs","volume":"124","author":"\u0141uczak","year":"2014","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/j.ejc.2026.104379_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2019.103057","article-title":"The shifting method and generalized Tur\u00e1n number of matchings","volume":"85","author":"Wang","year":"2020","journal-title":"Eur. J. Comb."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000478?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000478?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,30]],"date-time":"2026-05-30T01:47:20Z","timestamp":1780105640000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000478"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":20,"alternative-id":["S0195669826000478"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104379","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Counting the maximum number of sunflowers in hypergraphs with given matching number","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104379","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104379"}}