Lv, Zequn and Győri, Ervin and He, Zhen and Salia, Nika and Xiao, Chuanqi and Zhu, Xiutao (2024) The Maximum Number of Cliques in Graphs with Bounded Odd Circumference. ANNALS OF COMBINATORICS, Publis. ISSN 0218-0006
|
Text
s00026-023-00682-y.pdf Download (263kB) | Preview |
Official URL: https://doi.org/10.1007/s00026-023-00682-y
Abstract
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. © 2024, The Author(s).
| Item Type: | Article |
|---|---|
| Additional Information: | Export Date: 20 February 2024 Correspondence Address: Salia, N.; King Fahd University of Petroleum and MineralsSaudi Arabia; email: salianika@gmail.com Funding details: Nanjing University, NJU Funding details: Nemzeti Kutatási Fejlesztési és Innovációs Hivatal, NKFI, K116769, K132696, SNN117879 Funding text 1: The authors would like to extend their sincere gratitude to the two anonymous referees whose invaluable feedback and constructive criticism greatly contributed to the improvement of this work. The research of Győri and Salia is partially supported by the National Research, Development and Innovation Office—NKFIH, grant K116769, K132696 and SNN117879. The research of Zhu was supported by program B for an outstanding Ph.D. candidate at Nanjing University. |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA166-QA166.245 Graphs theory / gráfelmélet |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 05 Apr 2024 11:47 |
| Last Modified: | 05 Apr 2024 11:47 |
| URI: | https://real.mtak.hu/id/eprint/191880 |
Actions (login required)
 |
Edit Item |
