ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Are the following statements true? (i) For every k\ge0 there is c such that any tournament whose every vertex has out-neighbourhood chromatic number at most k has chromatic number at most c. (ii) If H=\Delta(T_2,T_2,T_2), then for every \varepsilon>0 there is c>0 such that every H-free tournament has a transitive subset of size at least c|V(G)|^{1-\varepsilon}.

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.