The monochromatic transversal game on clique-hypergraphs of powers of cycles
Speaker: Wilder P. Mendes, UFF.
Date: 26 aug 2020, 16h30.
Place: Google Meet: meet.google.com/ces-qqwf-coo.
Abstract: We introduce the monochromatic transversal game where the players, Alice and Bob, alternately colours vertices of a hypergraph. Alice, who colours the vertices with red, wins the game if she obtains a red transversal; and Bob wins if he does not let it happen, i.e. there exists a monochromatic blue hyperedge. Both players are enabled to start the game and they play optimally. We analyze the game played on clique-hypergraphs of complete graphs, paths, and powers of cycles. For each of these graphs, we show a strategy that allows one of the players to win the game.
Obs.: This joint work with Simone Dantas (IME/UFF), Sylvain Gravier (CNRS, Université Grenoble Alpes) and Rodrigo Marinho (IST, University of Lisbon, Portugal), was accepted for presentation and publication in the CTW 2020 (18th Cologne-Twente Workshop on Graphs and Combinatorial Optimization).
Support:
https://www.facebook.com/antenabrasileiradematematica/