1998
DOI: 10.1016/s0378-3758(98)00021-4
|View full text |Cite
|
Sign up to set email alerts
|

Quintessential pairwise balanced designs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
64
0
1

Year Published

1998
1998
1999
1999

Publication Types

Select...
5

Relationship

1
4

Authors

Journals

citations
Cited by 31 publications
(65 citation statements)
references
References 17 publications
0
64
0
1
Order By: Relevance
“…By deleting one point from this design, we obtain the result for n = 28. For the other stated values of n, the result can be found in [3]. Proof.…”
Section: Lemma 44 There Exists a {5 6}-gdd Of Typementioning
confidence: 88%
See 1 more Smart Citation
“…By deleting one point from this design, we obtain the result for n = 28. For the other stated values of n, the result can be found in [3]. Proof.…”
Section: Lemma 44 There Exists a {5 6}-gdd Of Typementioning
confidence: 88%
“…(1, 2, 5, 4, 12), (1,3,12,9,10), (1,4,3,6,8), (1,5,11,10,6), (1,9,2,8,11), (2,3,8,7,12), (2,4,10,3,11), (2, 7, 9, 5, 10), (3,7,6,11,9), (4,6,12,10,7), (4,8,5,7,11), (5,6,9,8,12). …”
Section: Direct Constructionsmentioning
confidence: 99%
“…This shows the existence of the triangular PBIBDs (( n+2 2 ), n 2 − 1, 2n − 3, (n + 2)/2; (0, 1)) and (( n+1 2 ), n 2 − 1, 2n − 3, n/2; (0, 1)) is equivalent. Chang et al [22] (also in [56, p. 152]) give a list of 18 unsolved triangular PBIBDs, which we may update by noting that four (7,13,14,15) have now been constructed ( [6], [23, Designs T41, T54, T91]), including the T (10) Seiden case above, and its T (9) reduction, and that four (3,11,16,18) , 1), we record the construction in [14]; we construct a {47; 5, 7, 9}-arc in PG (2,8) by deleting a hyperoval and an external line, then line-flipping an 8-line; we then apply Lemma 12.17 with k = 5, v = 47, f = 5, and a = 1.…”
Section: Lemma 132 If T [K 1; M] Exists Then We May Construct Thementioning
confidence: 99%
“…In the following lemma, we summarize the current results and the reader is referred to [3,7] for more details. (h, n) ∈ {(1, 10), (3, 6), (3, 18), (3, 28), (3, 34), (6,18), (6,19), (6, 23)}.…”
Section: Constructions By Hmolsmentioning
confidence: 99%
“…n , with the possible exception of (h, n) ∈ {(1, 6), (3,6), (3,18), (3,28), (3,34), (6,18), (6,19), (6, 23)}.…”
Section: Lemma 36 If H ≥ 1 and N ≥ 5 Then There Is A 5-hpmd Of Typmentioning
confidence: 99%