Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2107.11741

Cops and Robber on Cartesian products and some classes of hypergraphs

Pinkaew Siriwong·Ratinan Boonklurb·Henry Liu·Sirirat Singhun
View original source ↗Read source document ↗Export metadata ↓

Abstract

The game of Cops and Robber is a pursuit-evasion game which is usually played on a connected graph. In the game, a set of cops and a robber move around the vertices of a graph along edges, where the cops aim to capture the robber, while the robber aims to avoid capture. Much research about this game have been done since the early 1980s. The game has a natural generalisation to being played on connected hypergraphs, where the cops and the robber may now move along hyperedges. In this paper, we shall provide a characterisation of all hypergraphs where one cop is sufficient to capture the robber. The cop-number of a connected hypergraph is the minimum number of cops required in order to capture the robber. We shall prove some results about the cop-number of certain hypergraphs, including hypertrees and Cartesian products of hypergraphs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Pinkaew Siriwong, Ratinan Boonklurb, Henry Liu, Sirirat Singhun. 2021-07-25. Cops and Robber on Cartesian products and some classes of hypergraphs. https://arxiv.org/abs/2107.11741

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↗