For questions about matchings in graphs.

The study of matchings in graphs (bipartite and otherwise). A matching in a graph is a collection of edges no two of which share a common vertex. Common questions are the maximum size of a matching in a graph, the existence of matchings satisfying certain conditions, as well as structures on the set of all matchings.