Erdős Problem #1090

Partial progress by Aristotle and Gemini 3 Flash (27 Feb 2026): proof found (Lean).

Problem
Erdős problem #1090 (geometry, ramsey theory); current status: proved (Lean)
Credit
Aristotle and Gemini 3 Flash · AI building on known literature
Checked
Lean formalizationListed in Tao's wiki
Timeline
First AI contribution 2026-02-27 · wiki data as of 2026-06-30
Sources
Problem page (erdosproblems.com)Tao's AI-contributions wiki
PARTIALPer Tao's AI-contributions wiki

The problem

Let k≥3k\geq 3. Does there exist a finite set A⊂R2A\subset \mathbb{R}^2 such that, in any 22-colouring of AA, there exists a line which contains at least kk points from AA, and all the points of AA on the line have the same colour?

Statement quoted from erdosproblems.com/1090, maintained by Thomas Bloom. Original source: [Er75f,p.106]. Current status there: proved (Lean).

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 Literature
27 Feb, 2026 AI building on known literature Aristotle, Gemini 3 Flash 🟢 Proof found (Lean) 🟢 Graham and Selfridge (unpublished, ~1975)

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.

∎