Re: [math-fun] late follow-up

On 1/5/07, Michael Kleber <michael.kleber@gmail.com> wrote:

... Even if that doesn't lead to a proof of impossibility, it certainly means it's not surprising that a search for general integer-separation point sets would have a hard time finding ones with a unit distance: almost none of the sets you consider will meet the distance pairing constraint.

Oddly enough, for 5 vertices in 3 dimensions, the very first case [3, 3, 3, 2, 2, 2, 2, 2, 2, 2] does satisfy the above constraint! However, no other with edge up to 10 does so. WFL