In the mathematical discipline of graph theory a matching or edge-independent set in a graph's a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Definition Given a graph G = (V,E), a matching M in G's a set of pairwise non-adjacent edges; that's, no two edges share a common vertex. A vertex's matched if it's incident to an edge in the matching. Otherwise the vertex's unmatched. A maximal matching's a matching M of a graph G wi… (More on Matching)