ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a tournament TT, let χ⃗a(T)\vec{\chi}_{\rm a}(T) denote its acyclic dichromatic number. A fixed integer k≥3k\geq3 is treated as a constant rather than part of the input.

Tournament acyclic dicolouring algorithm conjecture. For every fixed k≥3k\geq3, it is polynomial-time decidable whether a tournament TT satisfies

χ⃗a(T)≤k.\vec{\chi}_{\rm a}(T)\leq k.

The case k=2k=2 is proved polynomial-time solvable in the paper, whereas the corresponding statement for every fixed k≥3k\geq3 is posed as an open complexity problem.

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.