Related papers: Lower Bounds for the Cop Number When the Robber is…
A gambler moves between the vertices $1, \ldots, n$ of a graph using the probability distribution $p_{1}, \ldots, p_{n}$. Multiple cops pursue the gambler on the graph, only being able to move between adjacent vertices. We investigate the…
We show that the cop number of any graph on 18 or fewer vertices is at most 3. This answers a question posed by Andreae in 1986, as well as more recently by Baird et al. We also find all 3-cop-win graphs on 11 vertices, narrow down the…
A classical result of Bondy and Simonovits in extremal graph theory states that if a graph on $n$ vertices contains no cycle of length $2k$ then it has at most $O(n^{1+1/k})$ edges. However, matching lower bounds are only known for…
The crossing number of a graph is the minimum number of crossings in a drawing of the graph in the plane. Our main result is that every graph $G$ that does not contain a fixed graph as a minor has crossing number $O(\Delta n)$, where $G$…
The obstacle number is a new graph parameter introduced by Alpert, Koch, and Laison (2010). Mukkamala etal (2012) show that there exist graphs with n vertices having obstacle number in Omega(n/\log n). In this note, we up this lower bound…
We study versions of cop and robber pursuit-evasion games on the visibility graphs of polygons, and inside polygons with straight and curved sides. Each player has full information about the other player's location, players take turns, and…
The Moore bound constitutes both an upper bound on the order of a graph of maximum degree $d$ and diameter $D=k$ and a lower bound on the order of a graph of minimum degree $d$ and odd girth $g=2k+1$. Graphs missing or exceeding the Moore…
An $n$-vertex, $d$-regular graph can have at most $2^{n/2+o_d(n)}$ independent sets. In this paper we address what happens with this upper bound when we impose the further condition that the graph has independence number at most $\alpha$.…
We show that a graph with $n$ vertices and vertex cover of size $k$ has at most $4^k + n$ potential maximal cliques. We also show that for each positive integer $k$, there exists a graph with vertex cover of size $k$, $O(k^2)$ vertices, and…
The guarding game is a game in which several cops try to guard a region in a (directed or undirected) graph against Robber. Robber and the cops are placed on the vertices of the graph; they take turns in moving to adjacent vertices (or…
In this paper, we consider a variant of the cops and robbers game on a graph, introduced by Kinnersley and Peterson, in which every time the robber uses an edge, it is removed from the graph, known as bridge-burning cops and robbers. In…
We show that for any $d\ge 2$ and $\Delta>0$ there exists $\eta>0$ such that the following holds: Let $G$ be an $n$-vertex graph with at least $\Omega(n^2)$ edges and let $H$ be an $n$-vertex $d$-degenerate graph with maximum degree at most…
We discuss winning possibilities of players in various variants of cops and robber game played on large random graphs, a testbed for various kinds of network queries, search problems in particular. We explore the use of logic frameworks to…
The bondage number of a graph is the smallest number of its edges whose removal results in a graph having a larger domination number. We provide constant upper bounds for the bondage number of graphs on topological surfaces, improve upper…
We study the localization game on dense random graphs. In this game, a {\em cop} $x$ tries to locate a {\em robber} $y$ by asking for the graph distance of $y$ from every vertex in a sequence of sets $W_1,W_2,\ldots,W_\ell$. We prove high…
In this paper, we obtain lower bounds for the domination numbers of connected graphs with girth at least $7$. We show that the domination number of a connected graph with girth at least $7$ is either $1$ or at least…
The cops and robbers game has been extensively studied under the assumption of optimal play by both the cops and the robbers. In this paper we study the problem in which cops are chasing a drunk robber (that is, a robber who performs a…
\textit{Pursuit-evasion games} have been intensively studied for several decades due to their numerous applications in artificial intelligence, robot motion planning, database theory, distributed computing, and algorithmic theory.…
We present two efficient algorithms that compute the optimal strategy for cop in the game of Cop v.s. Gambler where the gambler's strategy is not optimal but known to the cop. The first algorithm is analogous to Bellman-Ford algorithm for…
Given an $n$-point metric space $(X,d_X)$, a tree cover $\mathcal{T}$ is a set of $|\mathcal{T}|=k$ trees on $X$ such that every pair of vertices in $X$ has a low-distortion path in one of the trees in $\mathcal{T}$. Tree covers have been…