๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Directed Covering with Block Size 5 and Index Odd

โœ Scribed by Ahmed M. Assaf; H. Alhalees; L.P.S. Singh

Book ID
104444129
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
1009 KB
Volume
11
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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__

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

Pair covering and other designs with blo
Pair covering and other designs with block size 6
โœ R. Julian R. Abel; Iliya Bluskov; Malcolm Greig; Jan de Heer ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 218 KB ๐Ÿ‘ 1 views

## Abstract A __t__โ€(__v__, __k__, ฮป) covering design is a set of __b__ blocks of size __k__ such that each __t__โ€set of points occurs in at least ฮป blocks, and the covering number __C__~ฮป~(__v__, __k__, __t__) is the minimum value of __b__ in any __t__โ€(__v__, __k__, ฮป) covering design. In this ar