Directed-ordered whist tournaments and (v,5,1) difference families: Existence results and some new classes of Z -cyclic solutions

Discrete Applied Mathematics

Volumn 143, Issue 1-3, 2004, Pages 43-53

  Julian, R ^a   Abel, R ^a   Costa, Stephanie ^b   Finizio, Norman J ^b  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

^b University of Rhode Island   (United States)

Author keywords

Almost difference families; Difference families; Directed whist tournaments; Directed ordered whist tournaments; Near resolvable BIBDs; Ordered whist tournaments; Resolvable BIBDs; Whist tournaments; Z cyclic designs

Indexed keywords

FUNCTIONS; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

DIFFERENCE FAMILIES; DIRECTED WHIST TOURNAMENTS; DIRECTED-ORDERED WHIST TOURNAMENTS; ORDERED WHIST TOURNAMENTS; WHIST TOURNAMENTS; Z-CYCLIC DESIGNS;

GAME THEORY;

EID: 4243058198     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2003.12.005     Document Type: Article

References (19)

1. Abel R.J.R. Difference families. Colbourn C.J., Dinitz J.H. CRC Handbook of Combinatorial Designs. 1996;270-287 CRC Press, Boca Raton, FL.
2. R.J.R. Abel, M. Buratti, Some progress on (v,4,1) difference families, preprint.
3. R.J.R. Abel, G. Ge, An almost completion for the existence of triplewhist tournaments TWh(v), preprint.
4. Abrham J. Perfect systems of difference sets - a survey. Ars Combin. 17A:1984;5-36.
5. Anderson I. Combinatorial Designs and Tournaments. 1997;Oxford University Press, Oxford.
6. Anderson I., Finizio N.J., Leonard P.A. New product theorems for Z-cyclic whist tournaments. J. Combin. Theory Ser. A. 88:1999;162-166.
7. R. Baker, Whist tournaments, SE Conference on Combinatorics, Graph Theory and Computing, Florida Atlantic University, 1975, pp. 89-100.
8. Bennett F.E., Gronau H.-D.O.F., Ling A.C.H., Mullin R.C. PBD-closure. Colbourn C.J., Dinitz J.H. CRC Handbook of Combinatorial Designs. 1996;203-213 CRC Press, Boca Raton, FL.
9. Buratti M., Zuanni F. Perfect Cayley designs as generalizations of perfect Mendelsohn designs. Design Code. Cryptogr. 23:2001;233-247.
10. Chen K., Zhu L. Existence of. (q,k,1) difference families with q a prime power and k=4,5 J. Combin. Design. 7:1999;21-30.
11. Costa S., Finizio N.J. Ordered whist tournaments - existence results. Congr. Numer. 158:2002;35-41.
12. G. Ge, C.W.H. Lam, Some new triplewhist tournaments TWh (v), preprint.
13. Ge G., Zhu L. Frame constructions for. Z -cyclic triplewhist tournaments Bull. Inst. Combin. Appl. 32:2001;53-62.
14. 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.
15. Leonard P.A. Some new. Z -cyclic whist tournaments Utilitas Math. 49:1996;223-232.
16. Y. Lu, Triplewhist tournaments, preprint.
17. Mathon R. Constructions for cyclic Steiner 2-designs. Ann. Discrete Math. 34:1987;353-362.
18. Watson G.L. Bridge problem. Math. Gaz. 38:1954;129-130.
19. Yin J. Some combinatorial constructions for optical orthogonal codes. Discrete Math. 185:1998;201-219.