2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/77121Let S_m denote the m-vertex simple digraph formed by m-1 edges with a common tail. Let f(m) denote the minimum n such that every n-vertex tournament has a spanning subgraph consisting of n/m disjoint copies of S_m. We prove that m lg m - m lg lg m <= f(m) <= 4m^2 - 6m for sufficiently large m.5 pages, 1 figureCombinatorics05C20, 05C35, 05C70text