Connected factors in \(K_{1,n}\)-free graphs containing an \([a,b]\)-factor (Q2433740)

Let \(n\), \(a\), \(b\) be integers such that \(n \geq 3\), \(a \geq 1\) and \(a \leq b \leq a(n-2)+1\). Let \(G\) represent a connected \(K_{1,n}\)-free graph. If \(G\) has an \([a,b]\)-factor, then \(G\) has a connected \([a,b+n- \lceil b/a \rceil]\)-factor. The result is sharp: An example is given of such a \(G\) with an \([a,b]\)-factor but no connected \([a,b+n- \lceil b/a \rceil - 1]\)-factor, for \(b = ai\), \(1 \leq i \leq n-2\).