{"title":"A universal bound concerning t-intersecting families","authors":"P. Frankl","doi":"10.1007/s10474-023-01373-z","DOIUrl":null,"url":null,"abstract":"<div><p>A very short inductive proof is given for the maximal size of a <i>k</i>-graph on <i>n</i> vertices in which any two edges overlap in at least <i>t</i> vertices.</p></div>","PeriodicalId":50894,"journal":{"name":"Acta Mathematica Hungarica","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2023-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Mathematica Hungarica","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10474-023-01373-z","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A very short inductive proof is given for the maximal size of a k-graph on n vertices in which any two edges overlap in at least t vertices.
期刊介绍：
Acta Mathematica Hungarica is devoted to publishing research articles of top quality in all areas of pure and applied mathematics as well as in theoretical computer science. The journal is published yearly in three volumes (two issues per volume, in total 6 issues) in both print and electronic formats. Acta Mathematica Hungarica (formerly Acta Mathematica Academiae Scientiarum Hungaricae) was founded in 1950 by the Hungarian Academy of Sciences.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
