{"id":"https://openalex.org/W7147619795","doi":"https://doi.org/10.1016/j.ejc.2026.104379","title":"Counting the maximum number of sunflowers in hypergraphs with given matching number","display_name":"Counting the maximum number of sunflowers in hypergraphs with given matching number","publication_year":2026,"publication_date":"2026-04-02","ids":{"openalex":"https://openalex.org/W7147619795","doi":"https://doi.org/10.1016/j.ejc.2026.104379"},"language":"en","primary_location":{"id":"doi:10.1016/j.ejc.2026.104379","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejc.2026.104379","pdf_url":null,"source":{"id":"https://openalex.org/S204851967","display_name":"European Journal of Combinatorics","issn_l":"0195-6698","issn":["0195-6698","1095-9971"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.ejc.2026.104379","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132548284","display_name":"Wenkun Wang","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Wenkun Wang","raw_affiliation_strings":["School of Mathematics, Hunan University, Changsha 410082, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Hunan University, Changsha 410082, PR China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5132578945","display_name":"Yuejian Peng","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuejian Peng","raw_affiliation_strings":["School of Mathematics, Hunan University, Changsha 410082, PR China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, Hunan University, Changsha 410082, PR China","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5132548284","https://openalex.org/A5132578945"],"corresponding_institution_ids":["https://openalex.org/I16609230"],"apc_list":{"value":2880,"currency":"USD","value_usd":2880},"apc_paid":{"value":2880,"currency":"USD","value_usd":2880},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.51305368,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"136","issue":null,"first_page":"104379","last_page":"104379"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.36320000886917114,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.36320000886917114,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.14380000531673431,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.08510000258684158,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5601000189781189},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5426999926567078},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.3589000105857849},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.2808000147342682},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.2766999900341034}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8992999792098999},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8091999888420105},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5601000189781189},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5426999926567078},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4120999872684479},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3589000105857849},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C83833204","wikidata":"https://www.wikidata.org/wiki/Q5290322","display_name":"Domination analysis","level":4,"score":0.25429999828338623},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.ejc.2026.104379","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejc.2026.104379","pdf_url":null,"source":{"id":"https://openalex.org/S204851967","display_name":"European Journal of Combinatorics","issn_l":"0195-6698","issn":["0195-6698","1095-9971"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.ejc.2026.104379","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ejc.2026.104379","pdf_url":null,"source":{"id":"https://openalex.org/S204851967","display_name":"European Journal of Combinatorics","issn_l":"0195-6698","issn":["0195-6698","1095-9971"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Zero hunger","id":"https://metadata.un.org/sdg/2","score":0.6590833067893982}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322843","display_name":"Natural Science Foundation of\u00a0Hunan Province","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W7943539","https://openalex.org/W1506116723","https://openalex.org/W1533675320","https://openalex.org/W1996106086","https://openalex.org/W2011348418","https://openalex.org/W2019935404","https://openalex.org/W2031135338","https://openalex.org/W2045485109","https://openalex.org/W2083155064","https://openalex.org/W2095093161","https://openalex.org/W2767999970","https://openalex.org/W2807653645","https://openalex.org/W2983444098","https://openalex.org/W4293004844","https://openalex.org/W4312053972"],"related_works":[],"abstract_inverted_index":{"The":[0],"matching":[1,18,109,204,216,247],"conjecture":[2,248],"of":[3,9,28,45,77,80,188,190,214,231,289,311,324,326,349,351,372,374],"Erd\u0151s":[4],"concerns":[5],"the":[6,25,40,75,153,185,210,229,245,257,270,286,290,303,308,321,347,370],"maximum":[7,26,186,298,309,322],"number":[8,27,76,110,187,205,213,310,323,348,371],"edges":[10,47],"in":[11,82,198,217,249,261,272,302,319],"an":[12,55,340,361],"r":[13,33,38,41,50,56,91,99,107,119,124,132,137,142,149,165,172,192,197,199,328,333,341,353,358,376,381],"-uniform":[14,42,57,200,342],"graph":[15,43,58,343],"with":[16,202,228],"given":[17,203],"number.":[19],"It":[20],"is":[21,206,266,300],"natural":[22],"to":[23,209,306,315,368],"determine":[24],"other":[29],"substructures.":[30],"Let":[31],"S":[32,63,70,81,118,131,171,175,191,327,352,375],"\u2212":[34,51,120,133,143,166,181,193,329,354,377],"1":[35,52,121,134,182,194,330,355,378],",":[36,66,71,90,94,114,122,125,135,138,146,195,331,356,379],"2":[37,46,93,97,123,136,196,219,251,274,332,357,380],"denote":[39,74],"consisting":[44],"intersecting":[48],"at":[49],"vertices.":[53],"For":[54,285],"H":[59,65,72,83,102,126,160],"and":[60,101,157,241,263,269,277],"a":[61,215,237,254,297],"subgraph":[62],"\u2282":[64,103],"let":[67],"N":[68,116,129],"(":[69,117,130],")":[73,127,150],"isomorphic":[78],"copies":[79,189,325,350,373],".":[84,151,183,334,382],"We":[85],"show":[86,337],"that":[87,296,338],"if":[88,156,159],"s":[89,98,113,145,180],"\u2265":[92,96],"n":[95,105,140,147,163,168,178,260],"3":[100],"[":[104,139,144,162,167,177],"]":[106,141,148,164,169,179],"has":[108],"less":[111],"than":[112],"then":[115],"\u2264":[128],"Moreover,":[152],"equality":[154],"holds":[155],"only":[158],"=":[161],"\u2216":[170],"for":[173],"some":[174],"\u2208":[176],"Counting":[184],"graphs":[201],"also":[207],"related":[208],"hypergraph":[211,299],"Tur\u00e1n":[212],"\u2113":[218,250,273],"-norm":[220,252,275],"called":[221],"by":[222,239,359],"Balogh":[223],"et":[224],"al.":[225],"(2022).":[226],"Combining":[227],"result":[230,235,238,271],"Frankl":[232],"(2013),":[233],"our":[234,283],"implies":[236],"Brooks":[240,262,276],"Linz":[242,264,278],"(0000)":[243,265,279],"concerning":[244],"Erd\u0151s\u2019":[246],"(in":[253],"stronger":[255],"sense,":[256],"condition":[258],"on":[259],"sufficiently":[267],"large),":[268],"does":[280],"not":[281,345],"imply":[282],"result.":[284],"quantitative":[287],"part":[288],"main":[291],"result,":[292],"we":[293,313,336,364],"may":[294],"assume":[295],"shifted":[301],"proof.":[304],"Comparing":[305],"count":[307,369],"edges,":[312],"need":[314],"overcome":[316],"two":[317],"difficulties":[318],"counting":[320],"Firstly,":[335],"shifting":[339],"will":[344],"decrease":[346],"establishing":[360],"injection.":[362],"Secondly,":[363],"give":[365],"nontrivial":[366],"methods":[367]},"counts_by_year":[],"updated_date":"2026-06-19T17:40:00.097472","created_date":"2026-04-02T00:00:00"}