On Kirkman packing designs KPD({3,4},v) Original Research Article

A Kirkman packing design KPD({3,4∗∗},v), is a resolvable packing of a v-set by the maximum possible number of parallel classes, each containing two blocks of size 4 and all other blocks of size three. Such designs can be used to construct certain threshold schemes. In this paper, direct and recursive constructions are discussed for such designs. The existence of a KPD({3,4∗∗},v) is established for every v≡2(mod 3) with v⩾32.