Further results on the number of cliques in graphs covered by long cycles
Recently, Ji and Ye determined the maximum number of s -cliques in 2-connected graphs with given order and containing an edge that is not on any cycle of length at least k + 1 . They remark that it is interesting to characterize the extremal graphs. In this paper, we give such a characterization.
Authors
- Leilei Zhang (ORCID: https://orcid.org/0000-0002-0783-4820)
- Yanan Hu
Institutions
- Central China Normal University (CN)
- Shanghai Institute of Technology (CN)
Publication Details
- Journal
- Discrete Mathematics
- Published
- 2026-09-18
- DOI
- https://doi.org/10.1016/j.disc.2026.115436
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- China Postdoctoral Science Foundation
- Science and Technology Commission of Shanghai Municipality