The maximum number of cliques in graphs with bounded odd circumference
Combinatorics
2022-12-07 v2
Abstract
In this work, we give the sharp upper bound for the number of cliques in graphs with bounded odd circumferences. This generalized Tur\'an-type result is an extension of the celebrated Erd\H{o}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.
Cite
@article{arxiv.2212.01989,
title = {The maximum number of cliques in graphs with bounded odd circumference},
author = {Zequn Lv and Ervin Győri and Zhen He and Nika Salia and Chuanqi Xiao and Xiutao Zhu},
journal= {arXiv preprint arXiv:2212.01989},
year = {2022}
}