Erdős Problem #662 — Consider the triangular lattice with minimal distance between two points .
Consider the triangular lattice with minimal distance between two points . Denote by the number of distances from any points . For example , , and . Let be such that for all . Is it true that, provided is sufficiently large depending on , the number of distances is less than or equal to with equality perhaps only for the triangular lattice? In particular, is it true that the number of distances is less than ?
References
Primary source
Additional references
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
No proof or counterexample has been found, and the problem’s published wording appears defective.
Erdős, Lovász, and Vesztergombi ask whether sufficiently large one-separated point sets in the plane can have more pairs at distance at most than the corresponding triangular-lattice configuration, for every threshold . The original formulation appears to contain numerical errors, and its stronger literal reading is described as nonsensical.
Known results
- Fejes Tóth, 1942: hexagonal packing is optimal for the related densest-packing problem; this does not establish the full threshold-by-threshold extremality claim.
- The discussion proposes corrected triangular-lattice counts such as , , and , but supplies no proof of the conjectured extremality.
Current status (as of March 2026): The exact short-distance extremality problem remains open; only related packing results and clarification of defects in the formulation are recorded.
Solutions 0
No solutions have been posted yet.