Packing designs with equal-sized holes (Q5934189)

A packing design is a collection of \(k\)-element subsets (called blocks) out of a \(v\)-set \(V\) such that each pair of elements of the \(v\)-set is contained in at most \(\lambda\) blocks. A holey packing design (with equal-sized holes) is a packing design with the additional property that \(|V|= gu\), \(V\) is partitioned into \(u\) sets (called holes) of size \(g\), and the intersection of a block and a hole may contain at most one element. The size of the largest holey packing design with these parameters is denoted by \(P(k,\lambda ;g^u)\). In the current paper, the values of \(P(3,\lambda ;g^u)\) are determined for all positive integers \(g\), \(\lambda\), and \(u \geq 3\).