Matching in a graph
= Matching in a graph
{wiki=Matching_(graph_theory)}
= Matchings in a graph
{synonym}
A matching is a set of edges with no shared endpoints. It saturates a vertex set when every vertex in that set is incident to one of its edges.