n points so that no 2 pairs are equidistant, segment connects nearest points
Source: Spanish Mathematical Olympiad 1990 P6
August 2, 2018
combinatorial geometrycombinatorics
Problem Statement
There are points in the plane so that no two pairs are equidistant. Each point is connected to the nearest point by a segment. Show that no point is connected to more than five points.