Related papers: The Toucher-Isolator Game on Trees
Fix two integers $n, k$, with $n$ divisible by $k$, and consider the following game played by two players, Waiter and Client, on the edges of $K_n$. Starting with all the edges marked as unclaimed, in each round, Waiter picks two yet…
The treewidth is a structural parameter that measures the tree-likeness of a graph. Many algorithmic and combinatorial results are expressed in terms of the treewidth. In this paper, we study the treewidth of outer $k$-planar graphs, that…
A classical result of Robertson and Seymour (1986) states that the treewidth of a graph is linearly tied to its separation number: the smallest integer $k$ such that, for every weighting of the vertices, the graph admits a balanced…
For a positive integer $k$ we consider the $k$-vertex-connectivity game, played on the edge set of $K_n$, the complete graph on $n$ vertices. We first study the Maker-Breaker version of this game and prove that, for any integer $k \geq 2$…
The deduction game is a variation of the game of cops and robber on graphs in which searchers must capture an invisible evader in at most one move. Searchers know each others' initial locations, but can only communicate if they are on the…
Let $\Lambda$ be an infinite connected graph, and let $v_0$ be a vertex of $\Lambda$. We consider the following positional game. Two players, Maker and Breaker, play in alternating turns. Initially all edges of $\Lambda$ are marked as…
We study a variant of the Cops and Robbers game on graphs in which the robbers damage the visited vertices, aiming to maximize the number of damaged vertices. For that game with one cop against $s$ robbers a conjecture was made by Carlson,…
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must…
We generalise the popular cops and robbers game to multi-layer graphs, where each cop and the robber are restricted to a single layer (or set of edges). We show that initial intuition about the best way to allocate cops to layers is not…
The $3/5$-conjecture for the domination game states that the game domination numbers of an isolate-free graph $G$ on $n$ vertices are bounded as follows: $\gamma_g(G)\leq \frac{3n}5 $ and $\gamma_g'(G)\leq \frac{3n+2}5 $. Recent progress…
To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while…
In this paper, we continue the study of the total domination game in graphs introduced in [Graphs Combin. 31(5) (2015), 1453--1462], where the players Dominator and Staller alternately select vertices of $G$. Each vertex chosen must…
We present solutions to a continuous patrolling game played on network. In this zero-sum game, an Attacker chooses a time and place to attack a network for a fixed amount of time. A Patroller patrols the network with the aim of intercepting…
We investigate relations between different width parameters of graphs, in particular balanced separator number, treewidth, and cycle rank. Our main result states that a graph with balanced separator number k has treewidth at least k but…
By now, the Maker-Breaker connectivity game on a complete graph $K_n$ or on a random graph $G\sim G_{n,p}$ is well studied. Recently, London and Pluh\'ar suggested a variant in which Maker always needs to choose her edges in such a way that…
An isolating set of a graph is a set of vertices $S$ such that, if $S$ and its neighborhood is removed, only isolated vertices remain; and the isolation number is the minimum size of such a set. It is known that for every connected graph…
In this paper we introduce and study the domination game on hypergraphs. This is played on a hypergraph $\mathcal{H}$ by two players, namely Dominator and Staller, who alternately select vertices such that each selected vertex enlarges the…
Splay trees are a simple and efficient dynamic data structure, invented by Sleator and Tarjan. The basic primitive for transforming a binary tree in this scheme is a rotation. Sleator, Tarjan, and Thurston proved that the maximum rotation…
In the Maker-Breaker domination game, Dominator and Staller play on a graph $G$ by taking turns in which each player selects a not yet played vertex of $G$. Dominator's goal is to select all the vertices in a dominating set, while Staller…
Parity games have witnessed several new quasi-polynomial algorithms since the breakthrough result of Calude et al. (STOC 2017). The combinatorial object underlying these approaches is a universal tree, as identified by Czerwi\'nski et al.…