The design spectrum of the Shrikhande graph

Anthony D. Forbes, Carrie G. Rutherford

The design spectrum of a simple graph $G$ is the set of positive integers $n$ such that there exists an edgewise decomposition of the complete graph $K_n$ into $n(n - 1)/(2 |E(G)|)…