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

On Kirkman packing designs KPD({3,4},v)

โœ Scribed by H Cao; Y Tang

Book ID
108315921
Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
267 KB
Volume
279
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On resolvable designs S3(3; 4, v)
On resolvable designs S3(3; 4, v)
โœ Dieter Jungnickel; Scott A Vanstone ๐Ÿ“‚ Article ๐Ÿ“… 1986 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB
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

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