ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the graph input to the Pirates and Treasure game. A graph is cubic if every vertex has degree 33, and 3-connected if deleting fewer than three vertices does not disconnect it. Cubic or 3-connected hardness conjecture. Pirates and Treasure is NP-hard if GG is either cubic or 3-connected. This would extend the established NP-hardness results for planar and grid graphs to graph classes for which the path-adding reduction does not preserve the required structure; the source gives no 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.