ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a connected graph of order nn. In the Cat and Mouse localisation game, the cat receives only the information specified by the game rules and seeks to determine a vertex within a prescribed distance of the mouse. The logarithmic-distance conjecture. The cat can localise the mouse up to distance O(log⁡n)O(\log n) on any connected graph of order nn. This conjecture was motivated by results for trees and grids, where the mouse can be localised within bounded distance under the stated game rules. The supplied text does not establish its resolution.

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.