Erdős Problem #591

ChatGPT Deep research found that the problem had already been solved in the literature (17 Jan 2026). 2 AI contributions are recorded in all.

Problem
Erdős problem #591 (set theory, ramsey theory); current status: proved
Credit
ChatGPT Deep research · Literature search
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-01-17 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PRIOR
ART
Per Tao's AI-contributions wiki

The problem

Let α\alpha be the infinite ordinal ωω2\omega^{\omega^2}. Is it true that in any red/blue colouring of the edges of KαK_\alpha there is either a red KαK_\alpha or a blue K3K_3?

Statement quoted from erdosproblems.com/591, maintained by Thomas Bloom. Original source: [Er82e][Er87][Va99,7.82]. Current status there: proved.

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 Outcome
17 Jan, 2026 Literature search ChatGPT Deep research 🟢 Full solution found
1 Feb, 2026 Literature search Aletheia 🟢 Full solution found

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.

∎