The 3/5-conjecture for weakly $S(K_{1,3})$-free forests

Simon Schmidt

The $3/5$-conjecture for the domination game states that the game domination numbers of an isolate-free graph $G$ on $n$ vertices are bounded as follows: ${\gamma }_g(G)\le \frac{3n}{5}$ a…