Question $6(1$ point$)$

Let $G=(V,E)$ be a connected undirected graph. Let $M$ be a matching in $G.$

If there are more than one $M-$exposed nodes, then there must exist an $M-$augmenting path.

True

False

Let $G=(V,E)$ be a connected undirected graph. Let $M$ be a matching in $G.$

If there are more than one $M-$exposed nodes, then there must exist an $M-$augmenting path.

True

False