On the large-clique version of the Erdős-Sós theorem

Kun Cheng, Yurui Tang

For graphs $H$ and $F$, let $\mathrm{ex}(n,H,F)$ denote the maximum number of copies of $H$ in an $F$-free graph of order $n$. Motivated by the Erdős-Sós theorem, Gerbner and…