Partitioning Sets of Triples into Designs II

It is shown that the collection of all the \(\dbinom{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.