Let P be the convex hull of perfect matchings of a graph G=(V, E). The dominant of P is {y ~ R E : y/> x for some x e P}. A theorem of Fulkerson implies that, if G is bipartite, then the dominant of… (More)

The matching polyhedron theorem of Edmonds and Johnson, which gives the convex hull of capacitated perfect b-matchings of a bidirected graph, is proved by reducing this matching problem to the… (More)