The problem
Let . Does there exist a finite set such that, in any -colouring of , there exists a line which contains at least points from , and all the points of 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.
∎