Partitioning Sets of Triples into Designs II

Abstract

It is shown that the collection of all the ${\displaystyle (\genfrac{}{}{0ex}{}{10}{3})}$ triples chosen from a set of ten points can be partitioned into ten mutually disjoint $2-(9,3,1)$ designs in precisely $77$ non-isomorphic ways.