We now prove Lemma 3.1, showing that Algorithm 3 can be used to reduce the overall graph degree. There are two parts to doing this. First, we need to amplify the success probability of Lemma 3.2, which only showed a degree reduction in expectation, …