有界奇数圆周图中的最大聚类数

Pub Date : 2024-01-24 DOI:10.1007/s00026-023-00682-y

Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Chuanqi Xiao, Xiutao Zhu

{"title":"有界奇数圆周图中的最大聚类数","authors":"Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Chuanqi Xiao, Xiutao Zhu","doi":"10.1007/s00026-023-00682-y","DOIUrl":null,"url":null,"abstract":"<p>In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Maximum Number of Cliques in Graphs with Bounded Odd Circumference\",\"authors\":\"Zequn Lv, Ervin Győri, Zhen He, Nika Salia, Chuanqi Xiao, Xiutao Zhu\",\"doi\":\"10.1007/s00026-023-00682-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.</p>\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s00026-023-00682-y\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s00026-023-00682-y","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

在这项工作中，我们给出了有界奇数周长图中小群数的尖锐上界。这个广义的图兰型结果是著名的厄尔多斯和加莱定理的扩展，也是罗氏最新结果的加强。对于有界偶数周长的图，同样的约束是李和宁定理的一个微不足道的应用。

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

查看原文

微信好友朋友圈 QQ好友复制链接

The Maximum Number of Cliques in Graphs with Bounded Odd Circumference

In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Turán-type result is an extension of the celebrated Erdős and Gallai theorem and a strengthening of Luo’s recent result. The same bound for graphs with bounded even circumferences is a trivial application of the theorem of Li and Ning.

求助全文

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