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

Chenglin Cai, Yuejian Peng, Xiaojun Zhao. 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, 2026. [doi]

Abstract

Abstract is missing.