Abstract: | In this paper, we study mixed conditions on the binding number and the minimum degree of a graph G that guarantee the existence of a k-factor in G. Among others, we prove that a graph G of order n with δ(G) ? cn and bind(G) > (2 ? 3c)/(1 ? c), where c is any fixed number, has a 2-factor. |