erdős #1177
Let be a finite -uniform hypergraph, and let denote the collection of -uniform hypergraphs with chromatic number not containing .If is not empty then there exists of cardinality at most .If both and are non-empty then is non-empty.If are uncountable cardinals and is non-empty then is non-empty.
Worked, still open.
set theory · open · 0 attempts
use this record
vela registry pull vfr_37aec80d874a0239vela reproduce examples/erdos-problems