The existence of perfect Mendelsohn designs with block size 7

Discrete Mathematics

Volumn 190, Issue 1-3, 1998, Pages 1-14

  Abel, R J R ^a   Bennett, F E ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b MOUNT SAINT VINCENT UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0007075550     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00030-2     Document Type: Article

References (22)

1. R.J.R. Abel, Forty-three balanced incomplete block designs, J. Combin. Theory Ser. A 65 (1994) 252-267.
2. R.J.R. Abel, F. Bennett, H. Zhang, Perfect Mendelsohn designs with block size 6, preprint.
3. R.J.R. Abel, A.E. Brouwer, C.J. Colbourn, J.H. Dinitz, Mutually orthogonal Latin squares, in: C.J. Colbourn, J.H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996, pp. 111-142.
4. R.J.R. Abel, C.J. Colbourn, J.H. Dinitz, Incomplete Latin squares, in: C.J. Colbourn, J.H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs, CRC Press, Boca Raton, FL, 1996, pp. 142-172.
5. R.J.R. Abel, M. Greig, Balanced incomplete block designs with block size 7, Des. Codes Cryptography 13 (1998) 5-30.
6. F.E. Bennett, Direct constructions for perfect 3-cyclic designs, Ann. Discrete. Math. 15 (1982) 63-68.
7. F.E. Bennett, Y. Chang, J. Yin, H. Zhang, Existence of HPMDs with block size five, J. Combin. Des 5 (1997) 257-273.
8. F.E. Bennett, E. Mendelsohn, N.S. Mendelsohn, Resolvable perfect cyclic designs, J. Combin. Theory Ser. A 29 (1980) 142-150.
9. F.E. Bennett, K.T. Phelps, C.A. Rodger, J. Yin, L. Zhu, Existence of perfect Mendelsohn designs with k = 5 and λ > 1, Discrete Math. 103 (1992) 129-137.
10. F.E. Bennett, K.T. Phelps, C.A. Rodger, L. Zhu, Construction of perfect Mendelsohn designs, Discrete Math. 103 (1992) 139-151.
11. F.E. Bennett, J. Yin, H. Zhang, R.J.R. Abel, Perfect Mendelsohn packing designs with block size 5, Des. Codes & Cryptography 14 (1998) 5-22.
12. F.E. Bennett, J. Yin, L. Zhu, On the existence of perfect Mendelsohn designs with k = 7 and λ even, Discrete Math. 113 (1993) 7-25.
13. F.E. Bennett, X. Zhang, L.Zhu, Perfect Mendelsohn designs with block size 4, Ars Combin. 29 (1990) 65-72.
14. C.J. Colbourn, Orthogonal arrays of index more than one, in: C.J. Colbourn, J.H. Dinitz (Eds.), CRC Handbook of Combinatorial Designs CRC Press, Boca Raten, FL, 1996, 172-178.
15. C.J. Colbourn, Transversal designs with block size eight and nine, Eur. J. Combin. 17 (1996) 1-14.
16. C.J. Colbourn, Some direct constructions for incomplete transversal designs, J. Statist. Plann. Inference 56 (1996) 93-104.
17. H. Hanani, Balanced incomplete designs and related designs, Discrete. Math. 11 (1975) 255-369.
18. H. Hanani, BIBDs with block-size seven, Discrete. Math. 77 (1989) 89-96.
19. N.S. Mendelsohn, Perfect cyclic designs, Discrete Math. 20 (1977) 63-68.
20. Y. Miao, L. Zhu, Perfect Mendelsohn designs with block size six, Discrete Math. 143 (1995) 189-207.
21. R.M. Wilson, Constructions and uses of pairwise balanced designs, Math. Centre Tracts, vol. 55 (1974) 18-41.
22. J. Yin, The existence of (v, 6, 3)-PMDs, Mathematica Applicata 6 (1993) 457-462.