A neighborhood condition for graphs to have [a, b]-factors excluding a given subgraph

Let a, b and in be nonnegative integers with 1 <= a < b, and let G be a graph which has sufficiently large order n. Suppose that (G) >= a + 2m and vertical bar N-G(x)boolean OR N-G(y)vertical bar >= an/a+b for any two nonadjacent vertices x and y of G such that N-G(x)boolean AND N-G(y) not equal empty set. Then for any subgraph H of G with M edges, G has an [a, b]-factor excluding H. Furthermore, this result is best possible in some sense.