ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let R(n;k,r)R(n;k,r) be the smallest NN such that if the edges of KNK_N are rr-coloured then there is a set of nn vertices which does not contain a copy of KkK_k in at least one of the rr colours. Prove that there is a constant C=C(r)>1C=C(r)>1 such that R(n;3,r)<Cn.R(n;3,r) < C^{\sqrt{n}}.

Record

Added
Links

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.