Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2302.10972

Complexity of Maker-Breaker Games on Edge Sets of Graphs

Eric Duchêne·Valentin Gledel·Fionn Mc Inerney·Nicolas Nisse·Nacim Oijid·Aline Parreau·Miloš Stojaković
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the algorithmic complexity of Maker-Breaker games played on the edge sets of general graphs. We mainly consider the perfect matching game and the $H$-game. Maker wins if she claims the edges of a perfect matching in the first, and a copy of a fixed graph $H$ in the second. We prove that deciding who wins the perfect matching game and the $H$-game is PSPACE-complete, even for the latter in small-diameter graphs if $H$ is a tree. Toward finding the smallest graph $H$ for which the $H$-game is PSPACE-complete, we also prove that such an $H$ of order 51 and size 57 exists. We then give several positive results for the $H$-game. As the $H$-game is already PSPACE-complete when $H$ is a tree, we mainly consider the case where $H$ belongs to a subclass of trees. In particular, we design two linear-time algorithms, both based on structural characterizations, to decide the winners of the $P_4$-game in general graphs and the $K_{1,\ell}$-game in trees. Then, we prove that the $K_{1,\ell}$-game in any graph, and the $H$-game in trees are both FPT parameterized by the length of the game, notably adding to the short list of games with this property, which is of independent interest. Another natural direction to take is to consider the $H$-game when $H$ is a cycle. While we were unable to resolve this case, we prove that the related arboricity-$k$ game is polynomial-time solvable. In particular, when $k=2$, Maker wins this game if she claims the edges of any cycle.

Explore related subjects

cs.CCcs.DM

Keep this discovery

BibTeXRIS

Eric Duchêne, Valentin Gledel, Fionn Mc Inerney, Nicolas Nisse, Nacim Oijid, Aline Parreau, Miloš Stojaković. 2023-02-21. Complexity of Maker-Breaker Games on Edge Sets of Graphs. https://arxiv.org/abs/2302.10972

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

KEEP EXPLORING

Related papers

arXiv2026

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

cs.CC↗
arXiv2026

Topology inside NC$^1$

We show that ACC$^0$ is precisely what can be computed with constant-width circuits of polynomial size and polylogarithmic genus. This extends a characterization given by Hansen, showing that planar constant-width circuits also characterize ACC$^0$. Thus polylogarithmic genus provides no additional computational power in this model. We consider other generalizations of planarity, including crossing number and thickness. We show that constant-width circuits of polynomial size and thickness two already suffice to capture all of NC$^1$.

cs.CC↗