{"title":"Caps and wickets","authors":"Jakob Führer , Jozsef Solymosi","doi":"10.1016/j.disc.2024.114334","DOIUrl":null,"url":null,"abstract":"<div><div>Let <span><math><msubsup><mrow><mi>H</mi></mrow><mrow><mi>n</mi></mrow><mrow><mo>(</mo><mn>3</mn><mo>)</mo></mrow></msubsup></math></span> be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, <em>wicket</em>, is formed by three rows and two columns of a <span><math><mn>3</mn><mo>×</mo><mn>3</mn></math></span> point matrix. In this note, we give a new lower bound on the Turán number of wickets using estimates on cap sets. We also show that this problem is closely connected to important questions in additive combinatorics.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 3","pages":"Article 114334"},"PeriodicalIF":0.7000,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24004655","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
Let be a 3-uniform linear hypergraph, i.e. any two edges have at most one vertex common. A special hypergraph, wicket, is formed by three rows and two columns of a point matrix. In this note, we give a new lower bound on the Turán number of wickets using estimates on cap sets. We also show that this problem is closely connected to important questions in additive combinatorics.
期刊介绍：
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory.
Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
