Further results on the number of cliques in graphs covered by long cycles

Leilei Zhang

Let $\Gamma (n,k)$ be the set of $2$-connected $n$-vertex graphs containing an edge that is not on any cycle of length at least $k+1.$ Let $g_s(n,k)$ denote the maximum number of $s$-cli…