3.7.136. Matching

A constraint that allows for expressing the fact that we want to find a perfect matching on a graph with an even number of vertices. A perfect matching on a graph G with n vertices is a set of n/2 edges of G such that no two edges have a vertex in common.