Neighborhood conditions and \(k\)-factors (Q1382850)

A \(k\)-factor of a graph \(G\) is a spanning subgraph which is regular of degree \(k\). The authors give conditions involving a lower bound on the order \(n\) of \(G\), the parity of \(kn\), the minmum degree of \(G\), and the cardinalities of the unions of neighborhoods of non-adjacent vertices which guarantee that \(G\) has a \(k\)-factor.