Binding numbers for fractional ID-k-factor-critical graphs

Let G be a graph, and k . 2 be a positive integer. A graph G is fractional independentset-deletable k-factor-critical (in short, fractional ID-k-factor-critical), if G-I has a fractional k-factor for every independent set I of G. The binding number bind(G) of a graph G is defined as bind(G)=min{|NG(X)||X|:/0.X.V(G),NG(X).V(G)}. In this paper, it is proved that a graph G is fractional ID-k-factor-critical if n . 6k . 9 and bind(G) >[(3k.1)(n.1)]/(kn.2k+2).