The perfect matching polytope of a finite undirected graph 
is the convex hull of the 0-1 vectors
of its perfect matchings. For each perfect
matching 
,
let 
have coordinate 1 on edges in 
and 0 on the other edges. Writing
for the set of perfect matchings
gives
 |
For the complete graph 
, this is the singleton set
containing the one-coordinate vector 
.
