Erdős Problem #1128 — Monochromatic Countable Boxes in Triple Colorings
Statement
For sets , , and , a box is monochromatic under a coloring if there exists such that for every , every , and every . Is it true that for all sets with , and every coloring , there exist subsets , , and with such that is monochromatic?
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.