Abstract: | Define a -star to be the complete bipartite graph . In a 2014 article, Hoffman and Roberts prove that a partial -star decomposition of can be embedded in a -star decomposition of where is at most if is odd and if is even. In our work, we offer a straightforward construction for embedding partial -star designs and lower these bounds to and , respectively. |