Binding Number and Fractional <i>k</i>-Factors of Graphs

Abstract

In this paper, we consider the relationship between the binding number and the existence of fractional k-factors of graphs. The binding number of G is defined by Woodall as 1 bind G k k ≥ − . Furthermore, it is showed that both results are best possible in some sense.