Lax Lean Archive

While this submission is a draft, it cannot be used by other submissions.

Proof of `Kuhn's Algorithm Computes a Maximum Matching` (3rd statement)

groundedproofs/Lax117284Proofs/Bipartite/KuhnCorrect.lean · lax-117284

What this proof establishes

no assumptions

thm✓Lax117284.BipartiteKuhnCorrect (3rd statement)

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

At the end every left vertex is matched or failed, and a matching with that property is maximum by counting (Maximum.sizeleofsaturatingMaximum.size_le_of_saturating), without Berge's lemma.