Transversal game on hypergraphs and the 3/4-conjecture on the total domination game

The 3/4--Game Total Domination Conjecture posed by Henning, Klavžar, and Rall [Combinatorica, (2016)] states that if G is a graph on n vertices in which every component contains at least three vertices, then γtg(G)≤3/4n, where γtg(G) denotes the game total domination number of G. Motivated by this conjecture, we raise the problem to a higher level by introducing a transversal game in hypergraphs. We define the game transversal number, φg(H), of a hypergraph H, and prove that if every edge of H has size at least 2, and H ≇C₄, then φ_g(H) ≥ 4/11 (n_H + m_H), where n_H and m_H denote the number of vertices and edges, respectively, in H. Further, we characterize the hypergraphs achieving equality in this bound. As an application of this result, we prove that if G is a graph on n vertices with minimum degree at least 2, then γtg(G) < 8/11 n. As a consequence of this result, the 3/4-Game Total Domination Conjecture is true over the class of graphs with minimum degree at least 2.