ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let HH be a connected directed graph in which every vertex has positive indegree and outdegree. Let the core of HH mean its core under directed graph homomorphisms.

Bang-Jensen–Hell conjecture. If the core of HH is a directed cycle, then the HH-colouring problem is polynomial-time solvable. Otherwise, it is NP-complete.

This is a proposed dichotomy classification for directed graphs whose vertices all have positive indegree and outdegree. The conjecture remains open, although many special cases are known.

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.