The sharp exponent conjecture for rainbow antichain colorings
Statement
Let be an antichain of size , and let be the maximum size of a color class in a -coloring of avoiding a rainbow copy of . Sharp exponent conjecture. For any integers ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.