Thresholds for the biased Maker-Breaker domination games

Abstract: In the $(a,b)$-biased Maker-Breaker domination game, two players alternately select unplayed vertices in a graph $G$ such that Dominator selects $a$ and Staller selects $b$ vertices per move. Dominator wins if the vertices he selected during the game form a dominating set of $G$, while Staller wins if she can prevent Dominator from achieving this goal. Given a positive integer $b$, Dominator's threshold, $\textrm{a}<em>b$, is the minimum $a$ such that Dominator wins the $(a,b)$-biased game on $G$ when he starts the game. Similarly, $\textrm{a}&#39;_b$ denotes the minimum $a$ such that Dominator wins when Staller starts the $(a,b)$-biased game. Staller's thresholds, $\textrm{b}_a$ and $\textrm{b}&#39;_a$, are defined analogously. It is proved that Staller wins the $(k-1,k)$-biased games in a graph $G$ if its order is sufficiently large with respect to a function of $k$ and the maximum degree of $G$. Along the way, the $\ell$-local domination number of a graph is introduced. This new parameter is proved to bound Dominator's thresholds $\textrm{a}</em>\ell$ and $\textrm{a}_\ell&#39;$ from above. As a consequence, $\textrm{a}_1&#39;(G)\le 2$ holds for every claw-free graph $G$. More specific results are obtained for thresholds in line graphs and Cartesian grids. Based on the concept of $[1,k]$-factor of a graph $G$, we introduce the star partition width $\sigma(G)$ of $G$, and prove that $\textrm{a}_1&#39;(G)\le \sigma(G)$ holds for any nontrivial graph $G$, while $\textrm{a}_1&#39;(G)=\sigma(G)$ if $G$ is a tree.