Erdős Problem #959
Prior state unknown→proved
superlinear lower bound M(n) ≥ n^{1 + 1/(50000 log log n)}, improving Ω(n log n); the exact order remains open
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
geometry-topology / Distinct Distances
Erdős Problem #959
How large can the difference between the largest and second-largest distance multiplicities be among $n$ planar points?
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
How large can the difference between the largest and second-largest distance multiplicities be among $n$ planar points?
superlinear lower bound M(n) ≥ n^{1 + 1/(50000 log log n)}, improving Ω(n log n); the exact order remains open
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.