Proof of `Sparse graph thinning lemma`
groundedproofs/Lax54Proofs/AveragingLemma.lean · lax-54
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Proof of Lemma 4.2. Average the ordered edge count over all -element subsets, select a subset no denser than the ambient graph, and retain vertices whose degrees do not exceed the stated bound.