Counting cliques without generalized theta graphs

The \textit{generalized Tur\'an 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$. For the book graph $B_t$, there is a close connection between \ex(n,K_3,B_t) and the Ruzsa-Szemer\'edi triangle removal lemma. Motivated by this, in this paper, we study the generalized Tur\'an problem for generalized theta graphs, a natural extension of book graphs. Our main result provides a complete characterization of the magnitude of \ex(n,K_3,H) when $H$ is a generalized theta graph, indicating when it is quadratic, when it is nearly quadratic, and when it is subquadratic. Furthermore, as an application, we obtain the exact value of \ex(n, K_r, kF), where $F$ is an edge-critical generalized theta graph, and $3\le r\le k+1$, extending several recent results