Necessary conditions for the existence of (3; 6) generalized Whist tournament designs on v players are that v ≡ 0; 1 (mod 6). For v = 6n + 1 it is shown that these designs exist for all n. For v = 6n, it is impossible to have a design for n = 1, but for n ¿ 1 it is shown that designs exist, except possibly for 73 values of n the largest of which is n = 199.… (More)
In this study a new class of tournament designs is introduced. In particular, each game of the tournament involves several (two or more) teams competing against one another. The tournament is also required to satisfy certain balance conditions that are imposed on each pair of players. These balance conditions are related to both the total number of players… (More)
A new tool for the construction of Z-cyclic designs is introduced and several new Z-cyclic whist designs are constructed using this tool. In addition, several new infinite classes of Z-cyclic whist designs are presented.