Disjoint stars and forbidden subgraphs (Q2642341)

The author proves that if \(k \geq 3\), \(t \geq 3\) and if \(H\) is a connected graph of order at least 3 with the property that every \(H\)-free graph of sufficiently large order and minimum degree at least \(t\) contains \(k\) vertex-disjoint copies of the star \(K_{1,t}\), then \(H\) is a star \(K_{1,r}\), for \(r \geq 2\). He conjectures that if \(r,k,t\) are integers, \(r \geq 3\), \(k \geq 2\), \(t \geq 2\) and the graph \(G\) is \(K_{1,r}\)-free of order at least \((k-1)(t(r-1)+1)+1\) and minimum degree at least \(t\), then \(G\) contains \(k\) vertex-disjoint copies of \(K_{1,t}\). The author verifies this conjecture for \(t = 2\).