The problem
Characterize those finite 3-uniform hypergraphs which appear in every 3-uniform hypergraph of chromatic number .
Statement quoted from erdosproblems.com/593, maintained by Thomas Bloom. Original source: [Er95d]. Current status there: open.
AI contributions
As recorded in Terence Tao's wiki AI contributions to Erdős problems (data as of 30 Jun 2026). 🟢 full, 🟡 partial, ⚪ unverified, 🔴 incorrect.
| Date | Kind | AI systems | Humans | Outcome |
|---|---|---|---|---|
| 23 Jun, 2026 | AI working with humans | GPT | Eric Li | ⚪ Candidate full solution |
Caveats
The wiki's classifications are provisional and are not a benchmark. Many Erdős problems have never had a thorough literature review, so a result that looks new may later turn out to be known; some problems were also stated ambiguously or incorrectly. See the problem page for the full discussion.
∎