Many cliques in $H$-free subgraphs of random graphs

Noga Alon, Alexandr Kostochka, Clara Shikhelman

For two fixed graphs $T$ and $H$ let $ex(G(n,p),T,H)$ be the random variable counting the maximum number of copies of $T$ in an $H$-free subgraph of the random graph $G(n,p)$. We s…