Domination game: A proof of the 3/5-conjecture for graphs with minimum degree at least two

In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γ_g(G). In this paper, we prove that γ_g(G) ≤ 2n/3 for every n-vertex isolate-free graph G. When G has minimum degree at least 2, we prove the stronger bound γ_g(G) ≤ 3n/5; this resolves a special case of a conjecture due to Kinnersley, West, and Zamani [SIAM J. Discrete Math., 27 (2013), pp. 2090-2107]. Finally, we prove that if G is an n-vertex isolate-free graph with l vertices of degree 1, then γ_g(G) ≤ 3n/5 + [l/2] + 1; in the course of establishing this result, we answer a question of Brešar et al. [Discrete Math., 330 (2014), pp. 1-10].