Solution
= Solution
A <matching in a graph> is a <subset> $M\subseteq E$ whose <edges> have pairwise disjoint endpoints. It is a <perfect matching> when every <vertex> is incident to exactly one <edge> in $M$.
= Solution
A <matching in a graph> is a <subset> $M\subseteq E$ whose <edges> have pairwise disjoint endpoints. It is a <perfect matching> when every <vertex> is incident to exactly one <edge> in $M$.