The 3/5-conjecture for weakly $S(K_{1,3})$-free forests
The 3/5-conjecture for weakly $S(K_{1,3})$-free forests
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)\leq \frac{3n}5 $ and $\gamma_g'(G)\leq \frac{3n+2}5 $. Recent progress have been done on the subject and the conjecture is now proved for graphs with minimum degree …