𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coverings of Pairs by Quintuples

✍ Scribed by E.R Lamken; W.H Mills; R.C Mullin; S.A Vanstone

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
1021 KB
Volume
44
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Covering pairs by quintuples with index
Covering pairs by quintuples with index Ξ» 0 (mod 4)
✍ Ahmed M. Assaf πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 271 KB

## Abstract A (__v, k. Ξ»__) covering design of order __v__, block size __k__, and index Ξ» is a collection of __k__‐element subsets, called blocks, of a set __V__ such that every 2‐subset of __V__ occurs in at least Ξ» blocks. The covering problem is to determine the minimum number of blocks, Ξ±(__v,

Bipacking pairs by quintuples: The case
Bipacking pairs by quintuples: The case ν≑13 (mod 20)
✍ Ahmed M. Assaf πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 493 KB

) 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 bipacki

Packing pairs by quintuples with index 2
Packing pairs by quintuples with index 2: v odd, v β‰’ 13 (mod 20)
✍ Ahmed M. Assaf; L.P.S. Singh πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 676 KB

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