Local out-neighbour chromatic number versus global tournament chromatic number
Statement
For all there exists such that, if is a tournament in which the set of out-neighbours of each vertex has chromatic number at most , then .
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.