In mathematics, a matching for a graph is a subset of edges without common vertices.
Let G = (V,E) be a (undirected) graph. A subset M of E is called matching of G if no two edges of M are coincident.