{"title":"On Turán problems with bounded matching number","authors":"Dániel Gerbner","doi":"10.1002/jgt.23067","DOIUrl":null,"url":null,"abstract":"<p>Very recently, Alon and Frankl initiated the study of the maximum number of edges in <math>\n <semantics>\n <mrow>\n <mi>n</mi>\n </mrow>\n <annotation> $n$</annotation>\n </semantics></math>-vertex <math>\n <semantics>\n <mrow>\n <mi>F</mi>\n </mrow>\n <annotation> $F$</annotation>\n </semantics></math>-free graphs with matching number at most <math>\n <semantics>\n <mrow>\n <mi>s</mi>\n </mrow>\n <annotation> $s$</annotation>\n </semantics></math>. For fixed <math>\n <semantics>\n <mrow>\n <mi>F</mi>\n </mrow>\n <annotation> $F$</annotation>\n </semantics></math> and <math>\n <semantics>\n <mrow>\n <mi>s</mi>\n </mrow>\n <annotation> $s$</annotation>\n </semantics></math>, we determine this number apart from a constant additive term. We also obtain several exact results.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Very recently, Alon and Frankl initiated the study of the maximum number of edges in -vertex -free graphs with matching number at most . For fixed and , we determine this number apart from a constant additive term. We also obtain several exact results.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
