# Matching Problem - Select a subset of edges from a graph, so that no vertex is adjacent to two different vertices. (one-to-one matches are made)