2004
DOI: 10.1016/j.disc.2004.01.010
|View full text |Cite
|
Sign up to set email alerts
|

Odd and even group divisible designs with two groups and block size four

Abstract: We show the necessary conditions are su cient for the existence of GDD(n; 2; 4; 1, 2) with two groups and block size four in which every block intersects each group exactly twice (even GDD's) or in which every block intersects each group in one or three points (odd GDD's). We give a construction for near 3-resolvable triple systems TS(n; 3; 6) for every n ¿ 4, and these are used to provide constructions for several families of GDDs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0
2

Year Published

2007
2007
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(14 citation statements)
references
References 7 publications
0
12
0
2
Order By: Relevance
“…When 2 > 1, a GDD(6, 2, 4; 3j, 2 ) is obtained from a GDD(6, 2, 4; 3(j − 1), 2 − x) and a suitable (3, x) with 1 x 5. We now have: For n = 18, the critical designs are (3, 1), (3, 2), (3,4), (3,5), (6, 1), and (6,11). The case n = 7: In this case, 2 must be a multiple of six, but there are no other restrictions from Table 1 on 1 .…”
Section: Lemma 12mentioning
confidence: 93%
See 3 more Smart Citations
“…When 2 > 1, a GDD(6, 2, 4; 3j, 2 ) is obtained from a GDD(6, 2, 4; 3(j − 1), 2 − x) and a suitable (3, x) with 1 x 5. We now have: For n = 18, the critical designs are (3, 1), (3, 2), (3,4), (3,5), (6, 1), and (6,11). The case n = 7: In this case, 2 must be a multiple of six, but there are no other restrictions from Table 1 on 1 .…”
Section: Lemma 12mentioning
confidence: 93%
“…One example: the design GDD(17, 2, 4; 39, 72) should exist but is not constructible using the "nearby" even design GDD(17, 2, 4; 34, 64). The needed critical designs for n = 17 are the ( 1 , 2 ) pairs: (5,8), (8,14), (11,20) and (14,26).…”
Section: Lemma 12mentioning
confidence: 99%
See 2 more Smart Citations
“…Since GDD has been widely applied to graphs [7] and matrices [13], many authors proposed different constructions of a GDD. One can see [7,13,8] (X, G, B), where X is a finite set of cardinality v, G is a partition of X into groups, and B is a family of subsets (blocks) of X that satisfy…”
Section: Notationsmentioning
confidence: 99%