New product theorems for \(Z\)-cyclic whist tournaments
A whist tournament \(\text{Wh}(v)\) on \(v\) players is a \((v,4,3)\)-BIBD meeting additional conditions. An ordered block \((a,b,c,d)\) denotes a game in which the partner pair \(\{a,c\}\) opposes the partner pair \(\{b,d\}\). The whist conditions include that every player partners each other player exactly once, and opposes every other player exactly twice. The present note shows how existing product constructions for cyclic and 1-rotational block designs can be adapted to produce a highly effective method of deriving product theorems for whist tournaments.
scientific article; zbMATH DE number 1356440