erdős #1183
Let be maximal such that in any -colouring of the subsets of there is always a monochromatic family of at least sets which is closed under taking unions and intersections. Estimate .Let be defined similarly, except that we only require the family be closed under taking unions. Estimate . In particular, is it true that for some as , and ?
Worked, still open.
combinatorics · open · possible · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems