ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a connected cubic graph, and consider the decision problem that asks, for a connected cubic graph GG, whether GG admits an HH-coloring.

P12P_{12} dichotomy conjecture. If HH admits a P12P_{12}-coloring, then the HH-problem is NP-complete; if HH does not admit a P12P_{12}-coloring, then the HH-problem is polynomial-time solvable.

This conjecture proposes a complexity dichotomy governed by whether the target graph admits a P12P_{12}-coloring. The source presents it as an open problem; no proof of either direction is supplied.

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.