Abstract
AbstractIn 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.
Funder
National Research, Development and Innovation Office
HUN-REN Alfréd Rényi Institute of Mathematics
Publisher
Springer Science and Business Media LLC
Reference7 articles.
1. Debsoumya Chakraborti and Da Qi Chen. Exact results on generalized Erdős-Gallai problems. arXiv preprint arXiv:2006.04681, 2020.
2. Paul Erdős and Tibor Gallai. On maximal paths and circuits of graphs. Acta Mathematica Academiae Scientiarum Hungarica, 10(3-4):337–356, 1959.
3. Binlong Li and Bo Ning. Eigenvalues and cycles of consecutive lengths. Journal of Graph Theory, 103(3):486–492, 2023.
4. Ruth Luo. The maximum number of cliques in graphs without long cycles. Journal of Combinatorial Theory, Series B, 128:219–226, 2018.
5. Bo Ning and Xing Peng. Extensions of the Erdős–Gallai theorem and Luo theorem. Combinatorics, Probability and Computing, 29(1):128–136, 2020.