Clique game

The clique game is a positional game where two players alternately pick edges, trying to occupy a complete clique of a given size.

The game is parameterized by two integers n > k. The game-board is the set of all edges of a complete graph on n vertices. The winning-sets are all the cliques on k vertices. There are several variants of this game:

• In the strong positional variant of the game, the first player who holds a k-clique wins. If no one wins, the game is a draw.
• In the Maker-Breaker variant, the first player (Maker) wins if he manages to hold a k-clique, otherwise the second player (Breaker) wins. There are no draws.
• In the Avoider-Enforcer variant, the first player (Avoider) wins if he manages not to hold a k-clique. Otherwise, the second player (Enforcer) wins. There are no draws. A special case of this variant is Sim.

The clique game (in its strong-positional variant) was first presented by Paul Erdős and John Selfridge, who attributed it to Simmons. They called it the Ramsey game, since it is closely related to Ramsey's theorem (see below).

Winning conditions

Ramsey's theorem implies that, whenever we color a graph with 2 colors, there is at least one monochromatic clique. Moreover, for every integer k, there exists an integer R(k,k) such that, in every graph with $n\geq R_{2}(k,k)$ vertices, any 2-coloring contains a monochromatic clique of size at least k. This means that, if $n\geq R_{2}(k,k)$, the clique game can never end in a draw. a Strategy-stealing argument implies that the first player can always force at least a draw; therefore, if $n\geq R_{2}(k,k)$, Maker wins. By substituting known bounds for the Ramsey number we get that Maker wins whenever $k\leq {\log _{2}n \over 2}$.

On the other hand, the Erdos-Selfridge theorem implies that Breaker wins whenever $k\geq {2\log _{2}n}$.

Beck improved these bounds as follows:

• Maker wins whenever $k\leq 2\log _{2}n-2\log _{2}\log _{2}n+2\log _{2}e-10/3+o(1)$;
• Breaker wins whenever $k\geq 2\log _{2}n-2\log _{2}\log _{2}n+2\log _{2}e-1+o(1)$.

Ramsey game on higher-order hypergraphs

Instead of playing on complete graphs, the clique game can also be played on complete hypergraphs of higher orders. For example, in the clique game on triplets, the game-board is the set of triplets of integers 1,...,n (so its size is ${n \choose 3}$ ), and winning-sets are all sets of triplets of k integers (so the size of any winning-set in it is ${k \choose 3}$).

By Ramsey's theorem on triples, if $n\geq R_{3}(k,k)$, Maker wins. The currently known upper bound on $R_{3}(k,k)$ is very large, $2^{k^{2}/6}<R_{3}(k,k)<2^{2^{4k-10}}$. In contrast, Beck proves that $2^{k^{2}/6}<R_{3}^{*}(k,k)<k^{4}2^{k^{3}/6}$, where $R_{3}^{*}(k,k)$ is the smallest integer such that Maker has a winning strategy. In particular, if $k^{4}2^{k^{3}/6}<n$ then the game is Maker's win.