Skip to content

Erdős problem 99

Start work

For sufficiently large n, is it the case that any set of n points with minimum distance 11 that minimizes diameter must contain an equilateral triangle of side length 1?

How the state got here

0 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingNothing recorded here
  6. Next gapNot recorded

Result history

Published changes, performers, checks, and later corrections.

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 detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:7256a707df9e9201ae211415e3c88d633c5dc13d724d94be7f32ee3460725282
Metadata
sha256:1e00496786ae8f6767273c77dcffa2a2801cf837e7733de87ced365810d8e44d
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:f818e0035275a4239735786be6215a99b4052a17fd1d9d2bfbcd6e942f28169d
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON