## maximum matching and size

It says to prove that there are no edges in a graph whose maximum size is zero.

1. But this seems so obvious though. Since n/2 is the size, then there will be zero nodes and thus the size would be 0. But is there a better way to prove it?

2. Does every graph have only one maximum matching or or are there many? Prove it.