On the Domatic Game

Abstract

The domatic game with pallete size $k$ is a $2$-player game played on a graph $G$ recently introduced by Hartnell and Rall. Players Alice and Bob take turns choosing an uncolored vertex from $G$, and coloring it a color from $\{1,2,\dots,k\}$. The game ends once all vertices in $G$ have been assigned a color. Alice wins if all $k$ colors induce a dominating set of $G$, and otherwise Bob wins. The domatic game number, $\operatorname{dom_g}(G,X)$ is the the largest pallete size $k$ such that Alice wins the domatic game when player $X$ goes first (where $X$ is either Alice or Bob). We prove for any graph $G$ of order $n$, \[ \operatorname{dom_g}(G,X)=Ω\left(\frac{δ(G)}{\log n}\right). \] In addition, we show that for any $k$ there exists a graph $G$ with minimum degree $δ(G)=k$ and $\operatorname{dom_g}(G,X)=1$, and there exists a graph $G'$ with $\operatorname{dom_g}(G',X)=1$ while having (non-game) domatic number $\operatorname{dom}(G')=k$. We explore how the domatic game number changes when changing who goes first, and when considering subgraphs of $G$. We also introduce a score variant of the domatic game, and use this to get bounds on the original domatic game.

Figures (1)

• Figure 1: A drawing of $G_{134}$. Since $n_3\leq 134<n_4$, we have that $k=3$. This gives us that $|\mathcal{T}|=\binom{10}{3}=120$, while $|S|=10$ and $|U|=134-n_3=4$.

Theorems & Definitions (49)

• Proposition 2.1: HR2025
• Theorem 2.2: FHKS2002
• Theorem 2.3
• Proposition 2.4: HR2025
• Theorem 2.5
• proof
• Corollary 2.6
• Theorem 2.7: ES1973
• Corollary 2.8
• proof