Matchings in regular graphs from eigenvalues

Let G be a connected k-regular graph of order n. We find a best upper bound (in terms of k) on the third largest eigenvalue that is sufficient to guarantee that G has a perfect matching when n is even, and a matching of order n−1 when n is odd. We also examine how other eigenvalues affect the size of matchings in G.