A proof of the 3/4 conjecture for the total domination game
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, Klavzar, and Rall.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.