Large sets of disjoint packings on \(6k+5\) points (Q703680): Difference between revisions

\textit{P. J. Schellenberg} and \textit{D. R. Stinson} [J. Comb. Math. Comb. Comput. 5, 143--160 (1989; Zbl 0674.94008)] introduced this large set problem and used it to construct perfect threshold schemes. The authors show that a large set of maximal packings on \(6k+5\) points exists for every \(k\) (that is, a set of \(6k+1\) disjoint packings, all of which omit a cycle of length four).