{"title":"On hypergraph Turán problems with bounded matching number","authors":"Dániel Gerbner , Casey Tompkins , Junpeng Zhou","doi":"10.1016/j.ejc.2025.104155","DOIUrl":null,"url":null,"abstract":"<div><div>Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in <span><math><mi>n</mi></math></span>-vertex <span><math><mi>F</mi></math></span>-free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results.</div></div>","PeriodicalId":50490,"journal":{"name":"European Journal of Combinatorics","volume":"127 ","pages":"Article 104155"},"PeriodicalIF":0.9000,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Journal of Combinatorics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S019566982500037X","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/3/26 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Very recently, Alon and Frankl, and Gerbner studied the maximum number of edges in -vertex -free graphs with bounded matching number, respectively. We consider the analogous Turán problems on hypergraphs with bounded matching number, and we obtain some exact results.
期刊介绍：
The European Journal of Combinatorics is a high standard, international, bimonthly journal of pure mathematics, specializing in theories arising from combinatorial problems. The journal is primarily open to papers dealing with mathematical structures within combinatorics and/or establishing direct links between combinatorics and other branches of mathematics and the theories of computing. The journal includes full-length research papers on important topics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
