A short proof that matching matroids are
โ
Eberhard Triesch
๐
Article
๐
1992
๐
Elsevier Science
๐
English
โ 165 KB
We present an elementary proof of the well-known theorem of E&nor& and Fkdkerson that a matroid is a matching matroid if and only if it is transversal. Suppose G = (V, E) is a simple graph. It is well-known that match(G), the collection of all X C V which are covered by some matching in G, is the sy