ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AkA_k be an antichain of size kk, and let f(n,c,Ak)f(n,c,A_k) be the maximum size of a color class in a cc-coloring of Bn=2[n]B_n=2^{[n]} avoiding a rainbow copy of AkA_k. Sharp exponent conjecture. For any integers (l−1)(k−1)<c≤l(k−1)(l-1)(k-1)<c\le l(k-1),

f(n,c,Ak)=2(1/l+o(1))n.f(n,c,A_k)=2^{(1/l+o(1))n}.

The conjecture says that the construction described immediately beforehand has the correct exponential order for every indicated range of the number of colors; the source gives no proof of the matching upper bound.

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.