Abstract
We study the (a, b)-monochromatic transversal game that is a combinatorial Maker–Breaker game where Alice and Bob alternately colour a vertices in red and b vertices in blue of a hypergraph, respectively. Either player is enabled to start the game. Alice tries to construct a hyperedge transversal, and Bob tries to prevent this. The winner is Alice if she obtains a red hyperedge transversal; otherwise, Bob wins the game if he obtains a monochromatic blue hyperedge. Maker–Breaker games were determined to be PSPACE-complete. In this work, we analyze the game played on clique-hypergraphs of powers of cycles, and we show strategies that, depending on the choice of the parameters, allow a specific player to win the game.
Funder
Conselho Nacional de Desenvolvimento Científico e Tecnológico
Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior
Reference22 articles.
1. The game chromatic index of wheels
2. Coloring the Maximal Cliques of Graphs
3. Berge C., Hypergraphs: Combinatorics of Finite Sets, 1st edition. North-Holland, Amsterdam (1989).
4. Berlekamp E.R., Conway J.H. and Guy R.K., Winning Ways for Your Mathematical Plays: Volume 1 and 2, 1st edition. A. K. Peters Press, Natick (1981).
5. Transversal Game on Hypergraphs and the $\frac{3}{4}$-Conjecture on the Total Domination Game