Erdős Problem #1183 — Large monochromatic sublattices of the Boolean lattice
Statement
In every two-coloring of the subsets of an -element set, how large a monochromatic family must exist that is closed under both unions and intersections? How large if only closure under unions is required? For the latter quantity , is for every fixed and for every fixed , once is sufficiently large?
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.