Elsevier

Discrete Mathematics

Volume 103, Issue 2, 27 May 1992, Pages 121-128
Discrete Mathematics

Packing designs with block size 6 and index 5

https://doi.org/10.1016/0012-365X(92)90262-EGet rights and content
Under an Elsevier user license
open archive

Abstract

A (v, к, λ) packing design of order v, block size к and index λ is a collection of к-element subsets, called blocks, of a v-set V such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. The only previous work on the packing problem with к=6 concerns itself with the cases where the maximum packing design is in fact a balanced incomplete block design. In this paper we solve the packing problem with к=6 and λ=5 and all positive integers v with the possible exceptions of v=41, 47, 53, 59, 62, 71.

Cited by (0)