Vertex-disjoint K1 + (K1 ∪ K2) in K1,4-free graphs with minimum degree at least four

A graph is said to be K1,4-free if it does not contain an induced subgraph isomorphic to K1,4. Let k be an integer with k ≥ 2. We prove that if G is a K1,4-free graph of order at least 11k-10 with minimum degree at least four, then G contains k vertex-disjoint copies of K1 + (K1 ∪ K2).