Question about an old result of Erdős and Simonovits
Yep. The writing is not great (but this is a nice result [but there should be an easier proof by now]). Anyway, you should read the $n^{1+\alpha}$ in the proof as a fixed quantity $\tau$, which is the number of edges in the original graph. The rest then follows.