Let $F$ and $H$ be graphs. The subgraph counting function $\mathrm{ex}(n,H,F)$ is defined as the maximum possible number of subgraphs $H$ in an $n$-vertex $F$-free graph. This function is a direct generalization of the Turán function as $\mathrm{ex}(n,F)=\mathrm{ex}(n,K_2,F)$. The systematic study of $\mathrm{ex}(n,H,F)$ was initiated by Alon and Shikhelman in 2016 who generalized several classical …