geometry-topology / Combinatorial Geometry

Erdős Problem #654

the strongest form is disproved via configurations where every point sees at most about 3n/4 distinct distances; the weaker improvement remains open

10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

geometry-topologyFeb 1, 2026Significance 10/100Registry: expert verified

Erdős Problem #654

Prior state unknown→disproved

the strongest form is disproved via configurations where every point sees at most about 3n/4 distinct distances; the weaker improvement remains open

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

the strongest form is disproved via configurations where every point sees at most about 3n/4 distinct distances; the weaker improvement remains open

the strongest form is disproved via configurations where every point sees at most about 3n/4 distinct distances; the weaker improvement remains open

Recorded attempts

Evidence graph

Connected research record