REVIEW
A proof of the 3/4 conjecture for the total domination game
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
A proof of the 3/4 conjecture for the total domination game
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.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.