The set "C" constructed this way is a vertex cover: suppose that an edge "e" is not covered by "C"; then "M" ∪ {"e"} is a matching and "e" ∉ "M", which is a contradiction with the assumption that "M" is maximal.