Erdős Problem #598

A claim by Przemek Chojecki with Aristotle and GPT-5.4 Pro (22 Apr 2026) that has not yet been verified: candidate partial result.

Problem
Erdős problem #598 (set theory, ramsey theory); current status: open
Credit
Przemek Chojecki with Aristotle and GPT-5.4 Pro · AI working with humans
Checked
Listed in Tao's wiki
Timeline
First AI contribution 2026-04-22 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
UN-
VERIFIED
Per Tao's AI-contributions wiki

The problem

Let mm be an infinite cardinal and κ\kappa be the successor cardinal of 2ℵ02^{\aleph_0}. Can one colour the countable subsets of mm using κ\kappa many colours so that every X⊆mX\subseteq m with ∣X∣=κ\lvert X\rvert=\kappa contains subsets of all possible colours?

Statement quoted from erdosproblems.com/598, maintained by Thomas Bloom. Original source: [Er87]. 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
22 Apr, 2026 AI working with humans Aristotle, GPT-5.4 Pro Przemek Chojecki ⚪ Candidate partial result

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.

∎