Strong Ramsey Games: Drawing on an infinite board

Dan Hefetz, Christopher Kusch, Lothar Narins +3

We consider the strong Ramsey-type game ${\mathcal{R}}^{(k)}(\mathcal{H},{\aleph }_0)$, played on the edge set of the infinite complete $k$-uniform hypergraph $K_{\mathbb{N}}^k$. Two p…