The Perfect Matching Polytope
摘要
A geometrical object of great interest in the theory of combinatorial optimization is the perfect matching polytope of a graph. It turns out that tight cut decompositions of a matching covered graph, which were described in Chapter 4, are very relevant to understanding the properties of its perfect matching polytope. The purpose of this chapter is to explore some of these connections.