Subquadratic growth conjecture for acyclic subgraphs of tournaments
Statement
Let denote the maximum chromatic number of an acyclic subgraph of an oriented graph . Let be the smallest integer such that every tournament with more than vertices has .
Subquadratic growth conjecture.
This conjecture asks for an asymptotic improvement over the general product-coloring bound . The paper proves the modest improvement , but the conjectured subquadratic bound remains open.
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.