Maximum number of cliques in { C k 1 , C k 2 , C k 3 , ⋯ } -free graphs with 6 = k1 < k2 < ⋯ and k+1 − k ≤ 5
Discrete Mathematics · 2026-08 · 349 (8) · 115127
DOI: 10.1016/j.disc.2026.115127 ↗Kurz gefasst
Fachartikel in der Zeitschrift Discrete Mathematics, 2026-08. Verfasst von Chenglin Cai und 2 weiteren Autor:innen. Die Arbeit nennt 38 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Hunan Provincial Natural Science Foundation.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Förderung
- National Natural Science Foundation of China
- Hunan Provincial Natural Science Foundation
Zitieren
APA
Cai, C., Peng, Y., & Zhao, X. (2026). Maximum number of cliques in { C k 1 , C k 2 , C k 3 , ⋯ } -free graphs with 6 = k1 < k2 < ⋯ and k+1 − k ≤ 5. Discrete Mathematics, 349(8), 115127. https://doi.org/10.1016/j.disc.2026.115127
Vancouver
Cai C, Peng Y, Zhao X. Maximum number of cliques in { C k 1 , C k 2 , C k 3 , ⋯ } -free graphs with 6 = k1 < k2 < ⋯ and k+1 − k ≤ 5. Discrete Mathematics. 2026;349(8):115127. doi:10.1016/j.disc.2026.115127
BibTeX
@article{Cai2026,
author = {Cai, Chenglin and Peng, Yuejian and Zhao, Xiaojun},
title = {Maximum number of cliques in C k 1 , C k 2 , C k 3 , ⋯ -free graphs with 6 = k1 < k2 < ⋯ and k+1 − k ≤ 5},
journal = {Discrete Mathematics},
year = {2026},
volume = {349},
number = {8},
pages = {115127},
doi = {10.1016/j.disc.2026.115127}
}
EUVIMED