Connected factors in \(K_{1,n}\)-free graphs containing a \((g,f)\)-factor (Q1272538): Difference between revisions

Let \(G\) be a connected \(K_{1,n}\)-free graph, \(n\geq 3\), and let \(f\) and \(g\) be positive integer-valued functions defined on \(V(G)\) with \(g(v)\leq f(v)\) for each \(v\in V(G)\). The authors prove that \(G\) contains a connected \((g,f{+}n{-}1)\)-factor if \(G\) has a \((f,g)\)-factor. This result is best possible if \(f\) is a constant function and \(g=f\).