Contents

-

On the Bipacking Numbers g2(4)(ν)

R.G. Stanton1
1Department of Computer Science University of Manitoba Winnipeg, Canada R3T 2N2

Abstract

The quantity g2(k)(v) is the minimum number of blocks in a family of blocks from a v-set that covers all (v2) pairs exactly twice, given the restriction that the longest block in the covering family has length k (there may be many blocks of length k). We give certain results for the case k=4.