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.

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:ec520084abd4e77204a48f106d2438aca41ba1b73e1c831a7a95532a56a7420f
Metadata: sha256:829f09293930c7685e575dc6df74c1c0633bb6f7bcca0c115d54b25220f24472
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:6428c11b36f5b227fdae6d6ac3bdd076828e7b4d83109423d90279b2b0e3997f

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207