Vertex-disjoint t-claws in graphs

Abstract

Let $\delta (G)$ denote the minimum degree of a graph $G$. We prove that for $t\ge 4$ and $k\ge 2$, a graph $G$ of order at least $(t+1)k+\frac{11}{6}{t}^2$ with $\delta (G)\ge k+t-1$ contains $k$ pairwise vertex-disjoint copies of $K_{\mathrm{1,}t}$.