Erdős Problem #593

A claim by Eric Li with GPT (23 Jun 2026) that has not yet been verified: candidate full solution.

Problem
Erdős problem #593 (set theory, graph theory, hypergraphs, chromatic number); current status: open
Credit
Eric Li with GPT · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-06-23 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIEDPer Tao's AI-contributions wiki

The problem

Characterize those finite 3-uniform hypergraphs which appear in every 3-uniform hypergraph of chromatic number >ℵ0>\aleph_0.

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.

∎