Status
On this page
Status
Topics
Status
On this page
Status
Topics
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.
Source: erdosproblems.com/1177
A full solution has been claimed but not yet accepted. Settled in another form, for example when its parts resolve differently or the question is open-ended.
Open. The site labels the problem OPEN (page last edited 23 January 2026); the one result claimed against the problem is recorded on its claim page, and the standing in the frontmatter is derived from it.