Client-Waiter games on complete and random graphs

Oren Dean, Michael Krivelevich

For a graph G, a monotone increasing graph property P and positive integer q, we define the Client-Waiter game to be a two-player game which runs as follows. In each turn Waiter is…