\(k\)-factor and \(l\)-closure in graphs (Q1772195)

By a \(k\)-factor of a graph we mean its spanning \(k\)-regular subgraph. The graph obtained from a graph \(G\) recursively by joining nonadjacent vertices with degree sum at least \(l\) is called the \(l\)-closure of \(G\) and denoted by \(cl_l(G)\). The author proves that for any positive integer \(k\) and a graph \(G\) of order \(n\) such that \(nk\) is even, if \(n> \max\{(3k^2+2k+3)/8\), \(2k-1+\sqrt{3k^2-6k+3}\}\), the minimum degree of a vertex in \(G\) is at least \(k\) and \(cl_{n+k-2}(G)\) is a complete graph then \(G\) has a \(k\)-factor.