No label defined (Q4027337)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 125623
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 125623 |
Statements
21 February 1993
0 references
balanced incomplete block designs
0 references
packing
0 references
bound
0 references
0.8888355493545532
0 references
[For the entire collection see Zbl 0745.00024.] A packing is a family \(F\) of \(k\)-subsets (blocks) of a given set of \(v\) elements such that no two elements are contained in more than one member of \(F\). The cardinality of the largest such family is denoted by \(D(2,k,v)\). Using the weight method (involving block weights and design weights) the authors improve on the classical counting bound for \(D(2,k,v)\) for various small parameter values of \(k\) and \(v\).
0 references