Fractional factors and component factors in graphs with isolated toughness smaller than 1

Abstract

Let be a simple graph and let be two integers with . We prove that for every if and only if has a ‐factor, where denotes the number of isolated vertices of and is a special family of trees. Furthermore, we characterize the trees in in terms of their bipartition.