Proof of `Deterministic undirected uniform flow–cut algorithm`
groundedproofs/Lax455465Proofs/ProductCorollaries.lean · lax-455465
What this proof establishes
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
The undirected uniform algorithm is the product algorithm on all-one weights.
Proof strategy
Every vertex belongs to the demand support, so its size is the input order. Use the undirected product guarantee and rewrite its logarithmic factor.