Orthogonally Resolvable Matching Designs

Peter Danziger, Sophia Park

An Orthogonally resolvable Matching Design OMD$(n,k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be r…