The problem
Let be an infinite set for which there exists some such that in any subset of of size there are always at least with no three on a line.
Is it true that is the union of a finite number of sets where no three are on a line?
Statement quoted from erdosproblems.com/846, maintained by Thomas Bloom. Original source: [Er92b]. Current status there: disproved (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 |
|---|---|---|---|---|
| 21-25 Feb, 2026 | AI on its own; related literature found afterwards | DeepMind prover agent; OpenAI internal model (independently) | 🟢 Full solution (Lean); 🟢 Full solution | 🟡 Reiher, Rödl, and Sales (2024) |
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.
∎