Maximum-cardinality matching

Graph theory problem: find a matching containing the most edges

In graph theory, a maximum-cardinality matching is a special kind of subgraph useful in many computational contexts. Given a graph G, a matching is a subgraph where no two edges share a vertex. The cardinality of the matching is the number of edges in the subgraph, and the maximum cardinality is the largest number of edges a matching can contain.

From Wikipedia, under CC BY-SA. More on occurri.