关于匹配数有界的图兰问题

IF 0.9 3区数学 Q2 MATHEMATICS

Journal of Graph Theory Pub Date : 2023-12-06 DOI:10.1002/jgt.23067

Dániel Gerbner

{"title":"关于匹配数有界的图兰问题","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":16014,"journal":{"name":"Journal of Graph Theory","volume":"106 1","pages":"23-29"},"PeriodicalIF":0.9000,"publicationDate":"2023-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":16014,\"journal\":{\"name\":\"Journal of Graph Theory\",\"volume\":\"106 1\",\"pages\":\"23-29\"},\"PeriodicalIF\":0.9000,\"publicationDate\":\"2023-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Graph Theory\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23067\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Graph Theory","FirstCategoryId":"100","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/jgt.23067","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

最近，阿隆和弗兰克尔开始研究匹配数最多为 s$s$ 的 n$n$ 无顶点 F$F$ 图中的最大边数。对于固定的 F$F$ 和 s$s$，我们确定了除常数加法项之外的这一数目。我们还得到了几个精确结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

On Turán problems with bounded matching number

Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$ -vertex $F$ -free graphs with matching number at most $s$ . For fixed $F$ and $s$ , we determine this number apart from a constant additive term. We also obtain several exact results.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Graph Theory 数学-数学

CiteScore

1.60

自引率

22.20%

发文量

130

审稿时长

6-12 weeks

期刊介绍： The Journal of Graph Theory is devoted to a variety of topics in graph theory, such as structural results about graphs, graph algorithms with theoretical emphasis, and discrete optimization on graphs. The scope of the journal also includes related areas in combinatorics and the interaction of graph theory with other mathematical sciences. A subscription to the Journal of Graph Theory includes a subscription to the Journal of Combinatorial Designs .