Minimum degree of bipartite graphs and the existence of k-factors (Q757438)

The following result is proved: Let G be a graph and k a positive integer such that (i) \(k| V(G)|\) is even, (ii) \(\delta\) (G)\(\geq [| V(G)|]\), and (iii) \(| V(G)| \geq 4k-5\). Then G has a k-factor.