Csilla Bujtas: Total domination game on graphs and transversal game on hypergraphs

Povzetek. 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.