KöMaL 2013 B4518

Let $n \ge$2 be an even number, and let 0<$k$<$n$ be an integer. Find the smallest number $e$ with the following property: If a simple graph on $n$ points has at least $e$ edges then it contains $k$ pairwise edge-disjoint perfect matchings.