If $X$ is a connected graph, then an $X$-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to $X$. A uniformly resolvable $\{X, Y\}$-decomposition of the complete graph $K_{v}$ is an edge decomposition of $K_{v}$ into $r$ $X$-factors and $s$ $Y$-factors. In this talk, we will examine uniformly resolvable decompositions of $K_{v}$ into 1-factors and $n$-stars.

Bio: Melissa Keranen is a professor in the Department of Mathematical Sciences at Michigan Technological University. She received her Ph.D. from Michigan Tech in 2005, under the supervision of Donald Kreher. Her research interests include combinatorial designs and graph decompositions.