On packing designs with block size 5 and index 4

Ahmed M. Assaf, Alan Hartman

Research output: Contribution to journalArticlepeer-review


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 languageEnglish
Pages (from-to)111-121
Number of pages11
JournalDiscrete Mathematics
Issue number2
StatePublished - 15 Jan 1990
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'On packing designs with block size 5 and index 4'. Together they form a unique fingerprint.

Cite this