✦ LIBER ✦

Packing designs with block size 5 and indexes 8, 12, 16

✍ Scribed by Ahmed M Assaf; Nabil Shalaby

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 361 KB
Volume: 59
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(92)90095-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing designs with block size 6 and in

Packing designs with block size 6 and index 5

✍ Ahmed M. Assaf; Alan Hartman; N. Shalaby 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 473 KB

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

On packing designs with block size 5 and

On packing designs with block size 5 and index 4

✍ Ahmed M. Assaf; Alan Hartman 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 695 KB

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

Packing designs with block size 5 and in

Packing designs with block size 5 and index 2: The case υ even

✍ Ahmed M Assaf; Nabil Shalaby; L.P.S Singh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 465 KB

Balanced incomplete block designs with b

Balanced incomplete block designs with block size 8

✍ R. Julian R. Abel; Iliya Bluskov; Malcolm Greig 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB

## Abstract The necessary conditions for the existence of a balanced incomplete block design on υ ≥ __k__ points, with index λ and block size __k__, are that: For __k__ = 8, these conditions are known to be sufficient when λ = 1, with 38 possible exceptions, the largest of which is υ = 3,753. For

On small packing and covering designs wi

On small packing and covering designs with block size 4

✍ Alan Hartman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 325 KB

A packing (respectively covering) design of order v, block size k, and index ~ 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 (at least) 3. blocks. The packing (covering) problem is to determine the maximum (minimum) number of bloc

New results on GDDs, covering, packing a

New results on GDDs, covering, packing and directable designs with block size 5

✍ R. Julian R. Abel; Ahmed M. Assaf; Iliya Bluskov; Malcolm Greig; Nabil Shalaby 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB 👁 1 views

## 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__