Directed packings with block size 5 and even ν
✍ Scribed by N. Shalaby; J. Yin
- Book ID
- 105178763
- Publisher
- Springer
- Year
- 1995
- Tongue
- English
- Weight
- 508 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0925-1022
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## 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__
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