Embeddings of simple maximum packings of triples with \(\lambda\) even (Q1901040)

A packing \((V, B)\) of triples of order \(v\) and index \(\lambda\) is a collection \(B\) of 3-subsets of a \(v\)-set \(V\) such that each 2-subset of \(V\) is contained in at most \(\lambda\) triples of \(B\). A packing of triples is maximum \((\text{MPT}(v, \lambda))\) if no other packing contains more triples, and is simple if no triple is repeated. An \(\text{MPT}(v, \lambda)\) \((X, A)\) is said to be embedded in an \(\text{MPT}(u, \lambda)\) \((Y, B)\) if \(X\) is a proper subset of \(Y\), and \(A\) is a subcollection of \(B\). The authors use difference methods, not unlike those of \textit{G. Stern} [Arch. Math. 33, 204-208 (1979; Zbl 0435.05009)], to prove that for \(v> 2\) and any even \(\lambda\), the necessary and sufficient condition for an embedding of a simple \(\text{MPT}(v, \lambda)\) in a simple \(\text{MPT}(u, \lambda)\) is \(u\geq 2v+ 1\).