Semi-perfect 1-Factorizations of the Hypercube

Natalie C. Behague

A 1-factorization $\mathcal{M}=\{M_1,M_2,\dots ,M_n\}$ of a graph $G$ is called perfect if the union of any pair of 1-factors $M_i,M_j$ with $i\ne j$ is a Hamilton cycle. It is…