A proof of the 3/4 conjecture for the total domination game
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:JG2EJG5Mrecord.jsonopen to challenge →
classification
math.CO
keywords
dominationgametotalconjectureverticesconfirmingdescribedominator
read the original abstract
In this paper we describe a strategy for Dominator that finishes the total domination game in at most $3/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{\v{z}}ar, and Rall.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.