Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2509.05196

Limited-visibility Cops and Robbers on Hamming graphs

John Jones·William B. Kinnersley
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the classic game of Cops and Robbers, a team of cops pursues a robber through a graph. The traditional model of Cops and Robbers operates under the assumption that the cops know the robber's location at all times. Recently, however, there has been growing interest in models wherein the cops have only partial information about the robber's location. In this paper, we study the limited-visibility variant of Cops and Robbers, in which the cops only know the robber's position if some cop is within a fixed distance of the robber. For this variant of the game, we give bounds on the number of cops needed to capture a robber on Hamming graphs, and we use these results to settle several open problems posed by Clarke et al.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John Jones, William B. Kinnersley. 2025-09-05. Limited-visibility Cops and Robbers on Hamming graphs. https://arxiv.org/abs/2509.05196

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

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗