Erdős Problem #1028 — Imbalance of Two-Colorings of Pairs
Statement
For a finite set and a coloring , define its imbalance on by
Let be the minimum, over all such colorings of pairs from , of the maximum imbalance over all subsets . Determine the asymptotic order of ; specifically, prove or disprove that
as .
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.