On the PBD-closure of sets containing 3

Discrete Applied Mathematics

Volumn 95, Issue 1-3, 1999, Pages 251-272

  Gruttmuller M ^a  

^a UNIVERSITY OF ROSTOCK   (Germany)

Author keywords

Pairwise balanced design; PBD closure

Indexed keywords

EID: 0043280949     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(99)00079-7     Document Type: Article

References (8)

1. C.J. Colbourn, D.G. Hoffman, R. Rees, A new class of group divisible designs with block size three, J. Combin. Theory Ser. A 59 (1992) 73-89.
2. D.A. Drake, J.A. Larson, Pairwise balanced designs whose line size do not divide six, J. Combin. Theory Ser. A 34 (1983) 266-300.
3. P.B. Gibbons, R. Mathon, The use of hill-climbing to construct orthogonal steiner triple systems, J. Combin. Designs 1 (1993) 27-50.
4. H.-D.O.F. Gronau, R.C. Mullin, Ch. Pietsch, The closure of all subsets of {3,4, . . . , 10} which include 3, Ars Combin. 41 (1995) 129-161.
5. E. Mendelsohn, R. Rees, Mandatory representation designs, J. Combin. Theory Ser. A 49 (1988) 349-362.
6. R.C. Mullin, H.-D.O.F. Gronau, PBDs and GDDs, in: C.J. Colbourn, J.H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, 1996, pp. 185-226.
7. D.R. Stinson, Hill-climbing algorithms for the construction of combinatorial designs, Ann. Discrete Math. 26 (1985) 321-334.
8. R.M. Wilson, An existence theory for pairwise balanced designs I: Composition theorems and morphisms, J. Combin. Theory Ser. A 13 (1971) 220-245.