Proof of `Clique minors from connected matchings`
groundedproofs/Lax342547Proofs/HadwigerMatching/MinorBound.lean · lax-342547
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
The maximum is attained by an actual clique-minor branch model. This proves the bound for the literal Hadwiger number, including the empty graph.