On group divisible covering designs (Q1301707)
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 1334520
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On group divisible covering designs |
scientific article; zbMATH DE number 1334520 |
Statements
On group divisible covering designs (English)
0 references
18 May 2000
0 references
The notion of group divisible covering design (GDCD) is introduced. The number of blocks in a minimum GDCD with block size \(k\) and group-type \(g^u\), is the covering number \( C(k,g^u)\), whose values are determined for all positive integers \(g\) and \(u\geq 3\).
0 references
group divisible covering design
0 references
covering numbers
0 references
0 references
0.8729460835456848
0 references
0.8441911935806274
0 references
