ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a graph GG, let \b1(G)\b1(G) denote its independence number, and let c(G)c(G) denote the minimum number of cops needed to capture a robber on GG.

Turcotte's conjecture. For any positive integer pp and any graph GG such that α(G)<p\alpha(G)<p, we have

c(G)≤p−2.c(G)\leq p-2.

This conjecture proposes a general upper bound on the cop number in terms of the independence number. It was raised by Turcotte and is presented here as an open conjecture; the supplied material gives no evidence of a 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.