Polynomial-time acyclic k-dicolouring conjecture for tournaments
Statement
For a tournament , let denote its acyclic dichromatic number. A fixed integer is treated as a constant rather than part of the input.
Tournament acyclic dicolouring algorithm conjecture. For every fixed , it is polynomial-time decidable whether a tournament satisfies
The case is proved polynomial-time solvable in the paper, whereas the corresponding statement for every fixed 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.