A fast algorithm for the maximum clique problem
Discrete Applied Mathematics - Sixth Twente Workshop on Graphs and Combinatorial Optimization
Some new triplewhist tournaments TWh(v)
Journal of Combinatorial Theory Series A
Classification of whist tournaments with up to 12 players
Discrete Applied Mathematics
Existence of Z-cyclic 3PTWh (p) for any Prime p≡ 1 (mod 4)
Designs, Codes and Cryptography
On the coexistence of conference matrices and near resolvable 2-(2k + 1, k, k - 1) designs
Journal of Combinatorial Theory Series A
| Hi-index | 0.01 |
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. Whist tournaments for v players are known to exist for all v ≡ 0, 1 (mod 4). The special cases of directed whist tournaments and triplewhist tournaments are known to exist for all sufficiently large v, but for small v several open cases remain. In this paper we introduce a correspondence between near resolvable 2-(v, k, λ) designs and a particular class of codes. The near resolvable 2-(13, 4, 3) designs are classified by classifying the corresponding codes with an orderly algorithm. Finally, the thirteen-player whist tournaments are enumerated starting from the near resolvable 2-(13, 4, 3) designs.