Minimum vertex degree of a graph divided by 2 is smaller than maximum matching

74 Views Asked by At

Let G be a simple graph. δ(G) is the minimum vertex degree. Prove that if M is the maximum matching, then δ(G)/2 ≤ |M|.

How to prove this?