A proof of the 3/4 conjecture for the total domination game

In this paper we describe a strategy for Dominator that finishes the total domination game in at most $3\mathrm{/}4n$ moves for every graph $G$ on $n$ vertices without any isolated vertices or edges, confirming the 3/4-conjecture for the total domination game made by Henning, Klav{ž}ar, and Rall.