Abstract
A (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-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. In this paper we solve the packing problem with k=5, λ=4, and all positive integers v.
Original language | English |
---|---|
Pages (from-to) | 111-121 |
Number of pages | 11 |
Journal | Discrete Mathematics |
Volume | 79 |
Issue number | 2 |
DOIs | |
State | Published - 15 Jan 1990 |
Externally published | Yes |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics