The matching polytope is a mathematical structure associated with the graph theory concept of matchings in bipartite graphs. In general, a matching in a graph is a set of edges such that no two edges share a common vertex. The matching polytope is particularly defined for bipartite graphs, although it can extend to general graphs.
New to topics? Read the docs here!