No Dense Subgraphs Appear in the Triangle-free Graph Process

Stefanie Gerke, Tamás Makai

Consider the triangle-free graph process, which starts from the empty graph on $n$ vertices and a random ordering of the possible $\left(\genfrac{}{}{0ex}{}{n}{2}\right)$ edges; the edges are added in this…