Counting cliques without generalized theta graphs

Jun Gao, Zhuo Wu, Yisai Xue

The \textit{generalized Turán number} $\mathrm{ex}(n,T,F)$ is the maximum possible number of copies of $T$ in an $F$-free graph on $n$ vertices for any two graphs $T$ and $F$. Fo…