An improved Recursive Construction for Disjoint Steiner Quadruple Systems

Tuvi Etzion, Junling Zhou

Let $D(n)$ be the number of pairwise disjoint Steiner quadruple systems. A simple counting argument shows that $D(n)\le n-3$ and a set of $n-3$ such systems is called a large set…