1 problem

Let $T$ be a tree on $k$ vertices and let $r\geq3$. Write … For a graph $G$, let ${\mathcal N}(K_r,G)$ denote the number of copies of $K_r$ in $G$, and let ${\mathrm{ex}}(n,K_r,T)$…