%0 Journal Article %A Sizhong Zhou and Bingyuan Pu %D 2009 %J International Journal of Mathematical and Computational Sciences %B World Academy of Science, Engineering and Technology %I Open Science Index 35, 2009 %T [a, b]-Factors Excluding Some Specified Edges In Graphs %U https://publications.waset.org/pdf/3455 %V 35 %X Let G be a graph of order n, and let a, b and m be positive integers with 1 ≤ a<b. An [a, b]-factor of G is deļ¬ned as a spanning subgraph F of G such that a ≤ dF (x) ≤ b for each x ∈ V (G). In this paper, it is proved that if n ≥ (a+b−1+√(a+b+1)m−2)2−1 b and δ(G) > n + a + b − 2 √bn+ 1, then for any subgraph H of G with m edges, G has an [a, b]-factor F such that E(H)∩ E(F) = ∅. This result is an extension of thatof Egawa [2]. %P 1017 - 1019