The sharp terminal leave in random triangle removal

Starting from the complete graph on n vertices, repeatedly delete a uniformly chosen remaining triangle. The terminal edge count is asymptotic to $n^{3/2}/(2\sqrt2)$, with mean-square convergence after normalization by n^3/2. This proves the triangle case of the Joos–Kühn sharp-constant conjecture.