Problem

Source:

Tags: geometry, combinatorics



A finite number of points are plotted so that the distances between any two are distinct. Each point joins the one closest to it. Find the maximum number of segments that can start from a single point.