A (v, K, A) packing design of order v, block size K and index 1 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 I blocks. The packing problem is to determine the maximum number of blocks in a packing design. The only previous work on
Packing designs with block size 5 and index 2: The case υ even
✍ Scribed by Ahmed M Assaf; Nabil Shalaby; L.P.S Singh
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 465 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A (u, k, ,I) packing design of order u, block size k, and index I is a collection of k-element subsets, called blocks, of a u-set, V, such that every 2-subset of V occurs in at most A blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve
## Abstract This article looks at (5,λ) GDDs and (__v__,5,λ) pair packing and pair covering designs. For packing designs, we solve the (4__t__,5,3) class with two possible exceptions, solve 16 open cases with λ odd, and improve the maximum number of blocks in some (__v__, 5, λ) packings when __v__
## Abstract The necessary conditions for the existence of a super‐simple resolvable balanced incomplete block design on __v__ points with block size __k__ = 4 and index λ = 2, are that __v__ ≥ 16 and $v \equiv 4\; (\bmod\; {12})$. These conditions are shown to be sufficient. © 2006 Wiley Periodical
We consider direct constructions due to R. J. R. Abel and