Problem

erdos:90

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

Open Current State

Declared status: disproved (Lean)
Formalization: formalized
Prize: $500
Subjects: geometrydistances
OEIS: A186705
Sources: source:erdos-ai-contributions-wikisource:erdos-problemssource:formal-conjecturessource:jayyhk-erdos-leansource:vibemathed
Statement: www.erdosproblems.com

unit distance problem

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims