What is a matching in minimum degree $k$ graph?

236 Views Asked by At

Any graph on $n$ vertices with minimum degree $k$ has a matching of cardinality $\min\{k, \lfloor{\frac{n}{2}\rfloor}\}$.

How to prove this theorem.