ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let f(G)f(G) denote the maximum chromatic number of an acyclic subgraph of an oriented graph GG. Let g(n)g(n) be the smallest integer such that every tournament GG with more than g(n)g(n) vertices has f(G)>nf(G)>n.

Subquadratic growth conjecture.

g(n)=o(n2).g(n)=o(n^2).

This conjecture asks for an asymptotic improvement over the general product-coloring bound g(n)≤n2g(n)\leq n^2. The paper proves the modest improvement g(n)≤n2−(2−1/2)n+2g(n)\leq n^2-(2-1/\sqrt{2})n+2, 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 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.