0
$\begingroup$

I need to find a maximum matching in the graph below. I have to use the bold edges for this. I would say that adding the edges $2-6$ and $7-8$ should suffice. Is there a way how I could argue that this matching is indeed a maximum matching?

enter image description here

$\endgroup$
2
$\begingroup$

Once every vertex is matched, your matching is obviously maximum.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.