Combinatorial Game Theory and Graph Domination

Combinatorial game theory examines two‐player games with perfect information, no chance elements and an eventual termination. Moves are made alternately on well‐defined positions, often modelled by graphs, where each decision influences the available options for both players. Graph domination concerns the selection of a set of vertices such that every vertex in the graph is either in that set or adjacent to it. When these two areas intersect, one obtains domination games: players alternately claim vertices or edges, aiming to establish or prevent a dominating configuration. Such games blend structural graph theory with strategic analysis, leveraging techniques from the Sprague-Grundy theorem for impartial contests, bias control in Maker–Breaker scenarios and algorithmic characterisations of winning strategies. Beyond pure theory, these investigations inform network design, resource allocation and communication security by modelling adversarial placement problems. Recent advances have deepened our understanding of bias thresholds, complexity boundaries and exact outcome determination in restricted graph classes, while practical algorithms now address domination games on trees and other sparse structures. Together, these developments illustrate a rich synergy between abstract game principles and concrete graph‐theoretic objectives.

Research from Nature Portfolio

No recent Nature Portfolio content available.

Research from all publishers

Recent studies have introduced a nimber‐preserving reduction framework for impartial games, demonstrating a homomorphic Sprague-Grundy theorem. This approach not only preserves the Sprague-Grundy values (nimbers) under polynomial‐time transformations but also establishes completeness results for natural classes of short impartial rulesets, enhancing classical winnability‐preserving reductions.

Another line of work has resolved the Maker–Maker domination game on forests, presenting a linear‐time algorithm that decides the winner and characterises exactly which cycles admit a first‐player victory. This result complements earlier PSPACE-completeness findings on general graphs by pinpointing tractable cases in acyclic structures.

Earlier research on the odd cycle game under connected rules has refined bias thresholds for Maker–Breaker and Client–Waiter variants, revealing that connectivity constraints can significantly alter winning regions. These analyses introduce new “connected rule” paradigms that restrict move selections to maintain a single component, thereby deepening our grasp of how topological constraints influence game outcomes.

Combinatorial Game Theory and Graph Domination publication trend

The graph below shows the total number of articles in combinatorial game theory and graph domination across all publications each year (not limited to Nature Index journals).

Technical terms

Combinatorial game: A two‐player game with no chance moves, perfect information and a finite sequence of moves leading to a defined outcome.

Impartial game: A combinatorial game in which the available moves depend only on the position, not on which player is moving.

Partisan game: A game in which the two players have distinct move sets or objectives at certain positions.

Dominating set: A subset of vertices in a graph such that every vertex is either in the subset or adjacent to at least one member.

Domination game: A positional game in which players alternately claim vertices (or edges) with the aim of constructing or preventing a dominating set.

Grundy number (nimber): A value assigned to an impartial position representing its equivalence to a pile of tokens in the game of Nim under disjunctive sum.

References

1. Nimber-preserving reduction: Game secrets and homomorphic Sprague-Grundy theorem. Theoretical Computer Science (2024).
2. The Maker–Maker domination game in forests. Discrete Applied Mathematics (2024).
3. On the odd cycle game and connected rules. European Journal of Combinatorics (2020).