Strong Ramsey games: drawing on an infinite board

Abstract: We consider the strong Ramsey-type game

m a t h c a l R^{(k)} (m a t h c a l H, a l e p h_{0})

, played on the edge set of the infinite complete

k

-uniform hypergraph

K_{m a t h b b N}^{k}

. Two players, called FP (the first player) and SP (the second player), take turns claiming edges of

K_{m a t h b b N}^{k}

with the goal of building a copy of some finite predetermined

k

-uniform hypergraph

m a t h c a l H

. The first player to build a copy of

m a t h c a l H

wins. If no player has a strategy to ensure his win in finitely many moves, then the game is declared a draw. In this paper, we construct a

5

-uniform hypergraph

m a t h c a l H

such that

m a t h c a l R^{(5)} (m a t h c a l H, a l e p h_{0})

is a draw. This is in stark contrast to the corresponding finite game

m a t h c a l R^{(5)} (m a t h c a l H, n)

, played on the edge set of

K_{n}^{5}

. Indeed, using a classical game-theoretic argument known as emph{strategy stealing} and a Ramsey-type argument, one can show that for every

k

-uniform hypergraph

m a t h c a l G

, there exists an integer

n_{0}

such that FP has a winning strategy for

m a t h c a l R^{(k)} (m a t h c a l G, n)

for every

n g e q n_{0}

.

Recommendations

Cites work

Cited in

(9)

This page was built for publication: Strong Ramsey games: drawing on an infinite board