Let M be a matching in graph G, and let S be the set of vertices matched by M. Prove that there exists a maximum matching in G under which all vertices in S are matched?
Follow Math Help Forum on Facebook and Google+
View Tag Cloud