τ(G) and the Existence of Factors

Let G is a graph: When G is not completely graphτ(G) = min {|S|/ω(G−S)−1: S⊆V(G),and ω(G−S)≥2}; When G is completely graph,τ(G) = ∞. Which ω(G−S) is the number of branches of G-S. In this paper we give a result It is proved that the relationship between τ(G) and the exist of factors.