We present sufficient conditions for the existence of a \(k\)-factor in a simple graph depending on \(\sigma_2(G)\) and the neighbourhood of independent sets in our first theorem and on \(\sigma_2(G)\) and \(\alpha(G)\) in the second one.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.