Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.04824

The minimum degree question for the Maker Breaker Domination Game

Jakob Führer·Georg Grasegger·Paul Hametner·Oliver Roche-Newton
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Maker Breaker Domination Game is a two player game played on a graph $G$ in which the players take turns to claim a vertex from the graph. The aim of the Dominator is to claim the vertices of a dominating set, and the aim of the Staller is to prevent this. In this paper, we consider the following problem: for a given integer $d$, what is the size of the smallest (with respect to the number of vertices) graph with minimum degree $d$ such that the Dominator loses going first? We write $β(d)$ to denote the answer to this question. We determine the precise value of $β(d)$ for $d\leq 3$. For general $d$ it was known that $2^{d+1} \leq β(d) \leq 2^{d+1}+2d$; the upper bound is due to a construction communicated to us by Valentin Gledel, while the lower bound follows from a simple application of the Erdős-Selfridge Theorem. We improve the lower bound to $β(d) \geq 2^{d+1}+2$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jakob Führer, Georg Grasegger, Paul Hametner, Oliver Roche-Newton. 2026-06-03. The minimum degree question for the Maker Breaker Domination Game. https://arxiv.org/abs/2606.04824

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗