Perfect Matching Lemma (Matroid Exchange Graph)

combinatorics computation

Definition

Perfect Matching Lemma (Matroid Exchange Graph)

Let be a matroid. For two independent sets with , the exchange graph has a perfect matching and .