Remark: Family 188. The sharp constant 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\sqrt{2})$, with mean-square convergence after normalization by $n^{3/2}$. This proves the triangle case of the Joos–Kühn sharp-constant conjecture.

The authors are OpenAI. This companion does not verify the proof. The claim is not a theorem of the Enter series and not a premise of any registered sheet. It does not close O.1. O.1 stays NOT_CLOSED. It is not a de Sitter state and not the QdS external-leg scheme. No quantum coefficient is admitted. No compilation is asserted.