Establishing the matching polytope

Abstract This paper gives an elementary, inductive proof-“graphical” in spirit-of a theorem of Edmonds' which specifies the convex hull of the matchings of an arbitrary, finite, undirected graph in terms of a finite system of linear inequalities.