» This article is about mathematical matchings. For other senses of this word, see matching (disambiguation). In the mathematical discipline of graph theory a matching or edge independent set in a graph is 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 is a set of pairwise non-adjacent edges; that is, no two edges share a common vertex. We say that a vertex is matched if… (More on Matching)