Proof of `Singh–Lau bounded-degree spanning-tree theorem`
groundedproofs/Lax17Proofs/Exposed.lean · lax-17
What this proof establishes
no assumptions
thm✓
Lax17.SinghLauAssuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Singh–Lau additive-one bounded-degree spanning-tree rounding.