Show that a k-connected graph with at least 2k vertices contains a matching of size k. Is this best possible?
Hint: use following theorem.
Theorem: Every graph G = (V,E) contains a vertex set S with the following two properties:
(i) S is matchable to CG-S;
(ii) Every component of G-S is factor-critical.