Independence number, connectivity and f-factors

Abstract

A fairly substantial literature exists on the problem of determining sufficient conditions for graphs to possess factors, in terms of their connectivity and independence number. The purpose of this paper is to present some of these sufficient conditions, to discuss how they are interrelated and to prove in some sense a best possible result which fits into the above mentioned literature.