A (v, k, 1) packing design of order v, block size k, and index 1 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 I blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we provid
✦ LIBER ✦
Bipacking pairs by quintuples: The case ν≡13 (mod 20)
✍ Scribed by Ahmed M. Assaf
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 493 KB
- Volume
- 133
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
✦ Synopsis
) 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 L blocks. The packing problem is to determine the maximum number of blocks in a packing design. Packing with 1= 2 is called bipacking. In this paper we solve the bipacking problem in the case K = 5 and v = 13 (mod 20).
📜 SIMILAR VOLUMES
Packing pairs by quintuples with index 2
✍
Ahmed M. Assaf; L.P.S. Singh
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 676 KB
Covering pairs by quintuples: The case v
✍
W.H Mills; R.C Mullin
📂
Article
📅
1988
🏛
Elsevier Science
🌐
English
⚖ 737 KB