Question
4. Let M be a matching in a graph G, and let S be the set of vertices matched by M. Using Berge's Theorem, prove that there exists a maximum matching in G under which all vertices in S are matched. [6 marks]
Question image 1