Erdős problem 99
For sufficiently large n, is it the case that any set of n points with minimum distance that minimizes diameter must contain an equilateral triangle of side length 1?
Result history
No result history yet
No proposed change is retained for this Problem, so there is nothing to show a decision on.
Correction history
No correction history
Technical details
Exact provenance
- Problem row
- sha256:7256a707df9e9201ae211415e3c88d633c5dc13d724d94be7f32ee3460725282
- Metadata
- sha256:1e00496786ae8f6767273c77dcffa2a2801cf837e7733de87ced365810d8e44d
- Observation
- sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
- Content
- sha256:f818e0035275a4239735786be6215a99b4052a17fd1d9d2bfbcd6e942f28169d
- Repository
- sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
- Projection
- sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
- Source commit
- 2415f78e850aeee50afdca525c6f2e0ea606f207