Simonovits's theorem in random graphs

Ilay Hoshen, Wojciech Samotij

Let $H$ be a graph with $\chi (H)=r+1$. Simonovits's theorem states that, if $H$ is edge-critical, the unique largest $H$-free subgraph of $K_n$ is its largest $r$-partite subgraph,…