Erdős problem 90 · problems.science

Conjectured upper bound on how many pairs among $n$ points in the plane can be exactly one unit apart.

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

AI standalone
Erdős AI contributions wiki · 26 May, 2026
Machine
Claude Mythos
Open the source record
AI collaborating with humans
Erdős AI contributions wiki · 21 May-9 Jun, 2026
Machine
GPT-5.5 Pro
People
Ingo Althöfer, Michael Emmerich, Paata Ivanisvili, Tomasz Kania, leloy, mlewko, Eric Naslund, norxornor, Will Sawin, Carl Schildkraut, spiderduckpig, Tseng
Open the source record
Formalization
Erdős AI contributions wiki · 28 May-12 Jun, 2026
Machine
Aleph Prover
Open the source record
AI standalone
Erdős AI contributions wiki · 20 May, 2026
Machine
OpenAI internal model
Open the source record
construction
VibeMathed
Machine
OpenAI frontier model (specific version not disclosed)
People
Noga Alon, Thomas Bloom, Timothy Gowers, Daniel Litt, Will Sawin, Jacob Tsimerman, Melanie Matchett Wood
Reported outcome
resolved
Open the source record