Waiter-Client and Client-Waiter colourability games on a $k$-uniform hypergraph and the $k$-SAT game

Wei En Tan

Waiter-Client and Client-Waiter games are two-player, perfect information games, with no chance moves, played on a finite set (board) with special subsets known as the winning sets…