The logarithmic-distance conjecture for localising a mouse on graphs
Statement
Let be a connected graph of order . 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 on any connected graph of order . 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.