Skip to content

Erdős problem 982

If nn distinct points in R2\mathbb{R}^2 form a convex polygon then some vertex has at least ⌊n2⌋\lfloor\frac{n}{2}\rfloor different distances to other vertices.

Erdős Problems records this as falsifiable.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal1 retained
  4. Resolutionfalsifiable
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it110 share a topic
Erdős problem 94accepted
Carrying a Standing. Browse the topic.