Finding $k$ claws ($K_{1,3}$ bipartite graphs) in a graph?
Finding vertex-disjoint copies of a subgraph $H$ in a graph $G$ is known as Graph Packing.

You could use Divide and Color to find the claws in $O^*(4^k)$, also deterministically (look for Chen et al. construction of universal set for derandomization).