Csilla Bujtas: Total domination game on graphs and transversal game on hypergraphs
Datum objave: 10. 3. 2019
Seminar za diskretno matematiko
Torek, 12. 3. 2019, od 10h do 12h, Plemljev seminar, Jadranska 19Povzetek. In the talk, we consider these two types of competitive optimization games. Since a total dominating set of a graph is always a vertex cover (transversal) in the so-called open neighborhood hypergraph, the properties of the two games also coincide. In this way, we may consider the transversal game as a generalization of the total domination game and we can use the hypergraph representation for proving new results for the total domination game on graphs.