$H$-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups

Noga Alon, Clara Shikhelman

We consider the structure of $H$-free subgraphs of graphs with high minimal degree. We prove that for every $k>m$ there exists an $\epsilon :=\epsilon (k,m)>0$ so that the following holds. For eve…