On July 27, 2021, Euiwoong Lee (이의웅) from the University of Michigan gave a talk at the Discrete Math Seminar on the proof that the Karger-Stein algorithm finds the minimum k-cuts with the probability $\Omega(n^{-k})$, which is tight and improves previous bounds. The title of his talk was “The Karger-Stein algorithm is optimal for k-cut“.