2010
DOI: 10.1002/jcd.20253
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: This article looks at (5, k) GDDs and (v, 5, k) pair packing and pair covering designs. For packing designs, we solve the (4t, 5, 3) class with two possible exceptions, solve 16 open cases with k odd, and improve the maximum number of blocks in some (v, 5, k) packings when v small (here, the Schönheim bound is not always attainable). When k = 1, we construct v = 432 and improve the spectrum for v ≡ 14, 18 (mod 20). We also extend one of Hanani's conditions under which the Schönheim bound cannot be achieved (… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 39 publications
0
1
0
Order By: Relevance
“…4.6]. For 5-GDDs of type g u , a partial solution to the design spectrum problem has been achieved, [1], [2], [5], [6], [9], [10], [11], [14], [15], [16], [18], and for future reference, we quote the main result concerning 5-GDDs in the important paper of Wei and Ge, [16], which represents a considerable advance on [9, Theorem IV. 4.16] Proof.…”
Section: Introductionmentioning
confidence: 99%
“…4.6]. For 5-GDDs of type g u , a partial solution to the design spectrum problem has been achieved, [1], [2], [5], [6], [9], [10], [11], [14], [15], [16], [18], and for future reference, we quote the main result concerning 5-GDDs in the important paper of Wei and Ge, [16], which represents a considerable advance on [9, Theorem IV. 4.16] Proof.…”
Section: Introductionmentioning
confidence: 99%