Isolation Game in Graph Theory

• Isolation game in graph theory is a vertex-selection contest where players alternately build an isolating set to render the residual graph edgeless.
• The game’s analysis employs a marking formalism with closed neighborhoods to derive bounds such as g(G) ≤ n/2 and explore the conjectured 3n/7 upper limit.
• Exact evaluations on paths, cycles, and forests illustrate strategic complexities and provide insights into domination-style processes and related graph variants.

Searching arXiv for the cited paper and closely related work on the graph isolation game. arXiv_search("(Brešar et al., 2024) isolation game on graphs") arXiv_search query: "(Brešar et al., 2024) Isolation game on graphs" arXiv_search query: "(Bujtás et al., 11 Jul 2025) Bounds on the game isolation number and exact values for paths and cycles" The isolation game in graph theory is the special case $\mathcal F=\{K_2\}$ of the $\mathcal F$-isolation game introduced by Brešar, Dravec, Johnston, Kuenzel, and Rall. In this framework, two players alternately select vertices of a graph while jointly constructing an $\mathcal F$-isolating set, but with opposite optimization goals: Dominator seeks to minimize the final number of selected vertices, and Staller seeks to maximize it. For a graph $G=(V,E)$ and a family of graphs $\mathcal F$, a set $S\subseteq V(G)$ is $\mathcal F$-isolating if $G-N_G[S]$ contains no member of $\mathcal F$ as a subgraph. When $\mathcal F=\{K_2\}$, the residual graph is required to be edgeless, so the game terminates with an isolating set in the usual sense (Brešar et al., 2024).

1. Formal setting and basic parameters

Let $\mathcal F$0 be a graph and let $\mathcal F$1 be a finite family of forbidden graphs. For $\mathcal F$2, the closed neighborhood is

$\mathcal F$3

A set $\mathcal F$4 is $\mathcal F$5-isolating if the subgraph induced by the remaining vertices,

$\mathcal F$6

contains no member of $\mathcal F$7 as a subgraph. The minimum size of such a set is the ordinary $\mathcal F$8-isolation number,

$\mathcal F$9

The game version asks how large the selected set becomes under adversarial play. In the original notation, the Dominator-start and Staller-start game lengths are denoted by $\mathcal F$0 and $\mathcal F$1, respectively (Brešar et al., 2024). In later work on the special case $\mathcal F$2, the same two quantities are denoted by $\mathcal F$3 and $\mathcal F$4 (Bujtás et al., 11 Jul 2025). This difference is terminological rather than conceptual.

The special case $\mathcal F$5 is called the isolation game. Here the final residual graph must be independent, so the selected vertices isolate all edges. This makes the game a vertex-selection analogue of domination-style processes, but with a stopping condition defined by the disappearance of nontrivial residual components rather than by full domination alone (Brešar et al., 2024).

2. Game dynamics, legality, and termination

The $\mathcal F$6-isolation game is played by Dominator and Staller, who alternately build a chosen set $\mathcal F$7. The game state is tracked through a marked set $\mathcal F$8, initially empty, although the theory also allows partially marked graphs. At any stage, a vertex $\mathcal F$9 is playable if it dominates at least one vertex of a component of $G=(V,E)$0 that is not yet $G=(V,E)$1-free; equivalently, $G=(V,E)$2 is not playable precisely when $G=(V,E)$3 (Brešar et al., 2024).

After a legal move $G=(V,E)$4, the marked set is updated by

$G=(V,E)$5

together with all vertices of any newly $G=(V,E)$6-forbidden components of $G=(V,E)$7. The game ends when no playable vertex remains; in the formulation of the original paper this is equivalent to $G=(V,E)$8. By construction, the final chosen set $G=(V,E)$9 is then $\mathcal F$0-isolating (Brešar et al., 2024).

This marking formalism is important because the chosen set and the marked set are not identical. A move can cause many vertices to become marked even though only one new vertex is chosen. A plausible implication is that much of the strategic complexity lies in controlling the residual component structure rather than merely the cardinality of $\mathcal F$1.

3. Structural theory of the $\mathcal F$2-isolation game

A central result is the Continuation Principle. If $\mathcal F$3 and $\mathcal F$4, then playing on $\mathcal F$5 with $\mathcal F$6 already marked can only be no longer than playing on $\mathcal F$7 with $\mathcal F$8 marked:

$\mathcal F$9

The proof proceeds by an imagination argument with a real game and an imagined game played in parallel, copying Staller’s real moves into the imagined game and Dominator’s imagined moves into the real game whenever legal (Brešar et al., 2024).

An immediate consequence is the start-player inequality

$S\subseteq V(G)$0

Thus, for the original $S\subseteq V(G)$1-isolation game, the first-move advantage is tightly controlled (Brešar et al., 2024).

The theory also compares different forbidden families. If for every $S\subseteq V(G)$2 there exists $S\subseteq V(G)$3 with $S\subseteq V(G)$4 a subgraph of $S\subseteq V(G)$5, then for every graph $S\subseteq V(G)$6,

$S\subseteq V(G)$7

This monotonicity formalizes the idea that forbidding a structurally larger family can only make isolation easier. In particular, the paper gives the general bounds

$S\subseteq V(G)$8

and

$S\subseteq V(G)$9

These inequalities locate the game parameters between the ordinary isolation number and a factor-of-two enlargement (Brešar et al., 2024).

4. The isolation game proper: the $\mathcal F$0 bound and the $\mathcal F$1 conjecture

For $\mathcal F$2, the notation simplifies to $\mathcal F$3, $\mathcal F$4, and $\mathcal F$5. The foundational upper bound is

$\mathcal F$6

The proof assigns weight $\mathcal F$7 to every vertex initially and lets the weight drop to $\mathcal F$8 when a vertex becomes marked. Dominator’s strategy is to avoid playing inside an isolated $\mathcal F$9 residual and, in any other component, to play a vertex of degree at least $G-N_G[S]$0 whenever possible. Under this strategy each Dominator move reduces the total remaining weight by at least $G-N_G[S]$1, each Staller move by at least $G-N_G[S]$2, and once only isolated edges remain each move reduces the total by exactly $G-N_G[S]$3 (Brešar et al., 2024).

The original paper conjectures that the actual sharp upper bound is smaller. If $G-N_G[S]$4 has no isolated edge to start, then

$G-N_G[S]$5

The same work gives a family $G-N_G[S]$6 showing that this bound is attained if true: each vertex of an arbitrary base graph is “blown up” to the center of a path on $G-N_G[S]$7 vertices, yielding

$G-N_G[S]$8

This suggests that the conjectured $G-N_G[S]$9 law, if established in full generality, would be best possible (Brešar et al., 2024).

Later work sharpens the global $\mathcal F$0 picture. It proves that there are only two graphs attaining equality in the bound $\mathcal F$1, namely $\mathcal F$2 and $\mathcal F$3, and that there are precisely eleven graphs attaining equality in the bound $\mathcal F$4. The same paper constructs a new infinite family $\mathcal F$5 with

$\mathcal F$6

again confirming the sharpness of the conjectured ratio at the level of infinite examples (Bujtás et al., 11 Jul 2025).

5. Forests, paths, cycles, and exact evaluations

Forests occupy a special position. In any partially marked forest $\mathcal F$7, the original paper proves by induction that

$\mathcal F$8

In particular, for any forest $\mathcal F$9, the Dominator-start game never lasts longer than the Staller-start game. This forest monotonicity is stronger than the general $\mathcal F=\{K_2\}$0 bound and depends on the acyclic residual structure (Brešar et al., 2024).

For paths, the original paper establishes

$\mathcal F=\{K_2\}$1

using a strategy in which Dominator responds at distance exactly $\mathcal F=\{K_2\}$2 from Staller whenever possible. It also proves

$\mathcal F=\{K_2\}$3

and derives the exact values

$\mathcal F=\{K_2\}$4

when $\mathcal F=\{K_2\}$5 and $\mathcal F=\{K_2\}$6 (Brešar et al., 2024).

These partial results were later completed. For every $\mathcal F=\{K_2\}$7,

$\mathcal F=\{K_2\}$8

For every $\mathcal F=\{K_2\}$9,

$\mathcal F$00

and

$\mathcal F$01

The proof methods include “runs-and-gaps” lower bounds for Staller and periodic Dominator strategies that select every fifth new vertex around a cycle (Bujtás et al., 11 Jul 2025).

The same later paper also improves the general tree bound: if $\mathcal F$02 is a tree of order $\mathcal F$03, then

$\mathcal F$04

Its proof uses a refined weight-counting method on the residual tree, with vertices colored white, blue, or red and a three-stage strategy ensuring that in every two-move pair the total weight decreases by at least $\mathcal F$05 from an initial total of $\mathcal F$06 (Bujtás et al., 11 Jul 2025).

6. Related variants and terminological distinctions

A common source of confusion is that several graph games use closely related terminology while differing substantially in rules, state variables, and objectives. The total isolation game is one such variant. It is played on an isolate-free graph, and a legal move must be adjacent either to a vertex in a nontrivial component of $\mathcal F$07 or to a vertex that is isolated in $\mathcal F$08 and belongs to $\mathcal F$09. The resulting parameter $\mathcal F$10 satisfies

$\mathcal F$11

for connected graphs of order $\mathcal F$12,

$\mathcal F$13

when $\mathcal F$14, more generally

$\mathcal F$15

and

$\mathcal F$16

when $\mathcal F$17. Unlike the original isolation game, the Continuation Principle fails here: for $\mathcal F$18, one has $\mathcal F$19 (Henning et al., 6 Jan 2026).

Another distinct family is the Toucher–Isolator game, which is played on edges rather than vertices. Toucher and Isolator alternately claim previously unclaimed edges, Toucher moves first, and the parameter $\mathcal F$20 counts the number of vertices untouched by Toucher under optimal play. In this setting, Dowden, Kang, Mikalački, and Stojaković introduced the game and obtained general bounds, while Räty proved for every tree $\mathcal F$21 on $\mathcal F$22 vertices that

$\mathcal F$23

which is sharp because

$\mathcal F$24

These results concern a Maker-Breaker type edge-claiming game and should not be conflated with the vertex-selection isolation game on graphs (Dowden et al., 2019, Raty, 2020).

Within graph game theory, the isolation game is therefore best understood as a residual-component game governed by closed neighborhoods, partial marking, and isolating-set formation. Its current theory combines abstract comparison principles, sharp exact values on classical families, and a still-active search for the definitive $\mathcal F$25 upper bound beyond presently known classes and constructions (Brešar et al., 2024).