ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn denote the size of the one-dimensional game board, and let the robber have arbitrary speed. The game is played with cops attempting to catch the robber.

Sublinear cop conjecture. In the one-dimensional game of Rugby, for all speeds of the robber, o(n)o(n) cops suffice to win.

This conjecture asserts a sublinear upper bound on the number of cops needed in one dimension, uniformly over the robber's speed. The source presents it as one of two strongly suspected conjectures; no resolution is given.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.