Pair covering designs with block size 5

Discrete Mathematics

Volumn 307, Issue 14, 2007, Pages 1776-1791

  R Abel, R Julian ^a   Assaf, Ahmed ^b   Bennett, Frank E ^c   Bluskov, Iliya ^d   Greig, Malcolm ^e  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b CENTRAL MICHIGAN UNIVERSITY   (United States)

^c MOUNT SAINT VINCENT UNIVERSITY   (Canada)

^d UNIVERSITY OF NORTHERN BRITISH COLUMBIA   (Canada)

^e Greig Consulting   (Canada)

Author keywords

Covering design; GDD; ISBCD; PBD; Resolvable; SBCD

Indexed keywords

NUMERICAL METHODS;

BLOCK SIZE; GDD; PAIR COVERING DESIGNS; PBD; SBCD;

NUMBER THEORY;

EID: 34147180030     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2006.09.026     Document Type: Article

References (38)

1. Abel R.J.R., Costa S., and Finizio N.J. Directed-ordered whist tournaments and (v, 5, 1) difference families: existence results and some new classes of Z-cyclic solutions. Discrete Appl. Math. 143 (2004) 43-53
2. * }, 1) PBDs, preprint.
3. * }, 1) PBDs. J. Combin. Math. Combin. Comput. 32 (2000) 97-102
4. Abrham J. Perfect systems of difference sets-a survey. Ars Combin. 17A (1984) 5-36
5. Assaf A.M. An application of modified group divisible designs. J. Combin. Theory Ser. A 68 (1994) 152-168
6. * }, 1)-PBDs. Discrete Math. 279 (2004) 61-105
7. Ge G. Resolvable group divisible designs with block size four. Discrete Math. 243 (2002) 109-119
8. Ge G., and Lam C.W.H. Resolvable group divisible designs with block size four and group size six. Discrete Math. 268 (2003) 139-151
9. Ge G., Lam C.W.H., Ling A.C.H., and Shen H. Resolvable maximum packings with quadruples. Design Codes Cryptogr. 35 (2005) 287-302
10. Ge G., and Ling A.C.H. A survey on resolvable group divisible designs with block size four. Discrete Math. 279 (2004) 225-245
11. Ge G., and Ling A.C.H. Some more 5-GDDs and optimal (v, 5, 1) packings. J. Combin. Design 12 (2004) 132-141
12. Ge G., and Ling A.C.H. Asymptotic results on the existence of 4-RGDDs and uniform 5-GDDs. J. Combin. Design 13 (2005) 222-237
13. E.R. Lamken, Orthogonally resolvable designs and related combinatorial configurations, Ph.D. Thesis, University of Michigan, 1983.
14. Lamken E.R., Mills W.H., Mullin R.C., and Vanstone S.A. Coverings of pairs by quintuples. J. Combin. Theory Ser. A 44 (1987) 49-68
15. Lamken E.R., Mills W.H., and Rees R.S. Resolvable minimum coverings with quadruples. J. Combin. Des. 6 (1998) 431-450
16. Laufer P.J. Regular perfect systems of difference sets of size 4 and extremal systems of size 3. Ann. Discrete Math. 12 (1982) 193-201
17. W.H. Mills, personal communication.
18. Mills W.H. Covering designs I: coverings by a small number of subsets. Ars Combin. 8 (1979) 199-315
19. Mills W.H. A covering of pairs by quintuples. Ars Combin. 18 (1984) 21-31
20. Mills W.H., and Mullin R.C. Coverings of pairs by quintuples: the case v congruent to 3 (mod 4). J. Combin. Theory Ser. A 49 (1988) 308-322
21. Mills W.H., and Mullin R.C. Coverings and packings. In: Dinitz J.H., and Stinson D.R. (Eds). Contemporary Design Theory: A Collection of Surveys (1992), Wiley, New York 371-399
22. Mullin R.C. On covering pairs by quintuples: the cases v ≡ 3 or 11 modulo 20. J. Combin. Math. Combin. Comput. 2 (1987) 133-146
23. Mullin R.C. On the determination of the covering numbers C (2, 5, v). J. Combin. Math. Combin. Comput. 4 (1988) 123-132
24. Mullin R.C., and Gronau H.-D.O.F. PBDs and GDDs: the basics. In: Colbourn C.J., and Dinitz J.H. (Eds). The CRC Handbook of Combinatorial Designs (1996), CRC Press, Boca Raton, FL 185-193
25. Mullin R.C., and Horton J.D. Bicovers of pairs by quintuples: v even. Ars Combin. 26 (1988) 197-228
26. Mullin R.C., and Yin J. On packings of pairs by quintuples: v ≡ 3, 9 or 17 (mod 20). Ars Combin. 35 (1993) 161-171
27. Rees R.S. Group-divisible designs with block size k having k + 1 groups, for k = 4, 5. J. Combin. Design 8 (2000) 363-386
28. Rees R.S., and Stinson D.R. On the existence of incomplete block designs of block size four having one hole. Utilitas Math. 35 (1989) 119-152
29. Schönheim J. On coverings. Pacific J. Math. 14 (1964) 1405-1411
30. Shen H., and Shen J. Existence of resolvable group divisible designs with block size four I. Discrete Math. 254 (2002) 513-525
31. Stanton R.G., Buskens R.W., and Allston J.L. Computation of the covering number N (2, 5, 4). Utilitas Math. 37 (1990) 127-144
32. Stanton R.G., and Kalbfleisch J.G. Coverings of pairs by k-sets. Ann. New York Acad. Sci. 175 (1970) 366-369
33. R.G. Stanton, J.G. Kalbfleisch, R.C. Mullin, Covering and packing designs, in: Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and its Applications, University North Carolina, Chapel Hill NC, 1970, pp. 428-450.
34. Stinson D.R. A new proof of the Doyen-Wilson theorem. J. Austral. Math. Soc. Ser. A 47 (1989) 32-42
35. J. Wang, H. Shen, Embeddings of near resolvable designs with block size four, preprint.
36. Wilson R.M. An existence theory for pairwise balanced designs I: composition theorems and morphisms. J. Combin. Theory Ser. A 13 (1971) 220-245
37. Yin J., and Assaf A.M. Constructions of optimal packing designs. J. Combin. Design 6 (1998) 245-260
38. Yin J., Ling A.C.H., Colbourn C.J., and Abel R.J.R. The existence of uniform 5-GDDs. J. Combin. Design 5 (1997) 275-299