General frame constructions for Z-cyclic triplewhist tournaments

Frames are useful in dealing with resolvable designs such as resolvable balanced incomplete block designs and triplewhist tournaments. Z-cyclic triplewhist tournament frames are also useful in the constructions of Z-cyclic triplewhist tournaments. In this paper, the concept of an (h"1,h"2,...,h"n;u)-regular Z-cyclic triplewhist tournament frame is defined, and used to establish several quite general recursive constructions for Z-cyclic triplewhist tournaments. As corollaries, we are able to unify many known constructions for Z-cyclic triplewhist tournaments. As an application, some new Z-cyclic triplewhist tournament frames and Z-cyclic triplewhist tournaments are obtained. The known existence results of such designs are then extended.

[1]  R. Julian R. Abel,et al.  The Existence of Four HMOLS with Equal Sized Holes , 2002, Des. Codes Cryptogr..

[2]  Norman J. Finizio.  One frame and several new infinite families of Z-cyclic whist designs , 2004, Discret. Math..

[3]  Ian Anderson,et al.  Some new Z-cyclic whist tournament designs , 2005, Discret. Math..

[4]  M. Buratti.  Recursive constructions for difference matrices and relative difference families , 1998 .

[5]  Hanfried Lenz,et al.  Design theory , 1985 .

[6]  Steven Furino,et al.  Frames and Resolvable Designs: Uses, Constructions and Existence , 1996 .

[7]  R. Julian R. Abel,et al.  Directed-ordered whist tournaments and (v, 5, 1) difference families: existence results and some new classes of Z-cyclic solutions , 2004, Discret. Appl. Math..

[8]  L. Zhu,et al.  On the existence of triplewhist tournaments TWh(v) , 1997 .

[9]  Yanxun Chang,et al.  General Constructions for Double Group Divisible Designs and Double Frames , 2002, Des. Codes Cryptogr..

[10]  Norman J. Finizio,et al.  Some new Z-cyclic whist tournaments , 2000, Discret. Appl. Math..

[11]  R. Julian R. Abel,et al.  Some difference matrix constructions and an almost completion for the existence of triplewhist tournaments TWh(upsilon) , 2005, Eur. J. Comb..

[12]  Charles J. Colbourn,et al.  Edge-coloured designs with block size four , 1988 .

[13]  Marco Buratti.  Existence of Z-Cyclic Triplewhist Tournaments for a Prime Number of Players , 2000, J. Comb. Theory, Ser. A.

[14]  R. Julian R. Abel,et al.  New Z-cyclic triplewhist frames and triplewhist tournament designs , 2006, Discret. Appl. Math..

[15]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[16]  Y. S. Liaw.  Construction of Z-cyclic triple whist tournaments , 1996 .

[17]  Gennian Ge,et al.  Existence of directedwhist tournaments with the three person property 3PDWh(v) , 2006, Discret. Appl. Math..

[18]  Alan C. H. Ling,et al.  A new construction for Z-cyclic whist tournaments , 2003, Discret. Appl. Math..

[19]  Clement W. H. Lam,et al.  Some new triplewhist tournaments TWh(v) , 2003, J. Comb. Theory, Ser. A.

[20]  I. Anderson.  Combinatorial Designs and Tournaments , 1998 .

[21]  Norman J. Finizio.  A representation theorem and Z-cyclic whist tournaments , 1995 .

[22]  E. H. Moore,et al.  Tactical Memoranda I-III , 1896 .

[23]  Lie Zhu,et al.  Some recent developments on BIBDs and related designs , 1993, Discret. Math..

[24]  Ryoh Fuji-Hara,et al.  Optical orthogonal codes: Their bounds and new optimal constructions , 2000, IEEE Trans. Inf. Theory.

[25]  R. Julian R. Abel,et al.  Generalized whist tournament designs , 2003, Discret. Math..

[26]  R. Julian R. Abel,et al.  Existence of directed triplewhist tournaments with the three person property 3PDTWh(v) , 2008, Discret. Appl. Math..

[27]  Marco Buratti,et al.  Perfect Cayley Designs as Generalizations of Perfect Mendelsohn Designs , 2001, Des. Codes Cryptogr..

[28]  Norman J. Finizio.  Whist Tournaments - Three Person Property , 1993, Discret. Appl. Math..

[29]  Ian Anderson,et al.  Triplewhist tournaments that are also Mendelsohn designs , 1997 .

[30]  R. Baker.  Factorization of graphs , 1975 .

[32]  Ian Anderson,et al.  New Product Theorems for Z-Cyclic Whist Tournaments , 1999, J. Comb. Theory, Ser. A.