Let be given n points, no three of which are on a line. All the segments with endpoints in these points are colored so that two segments with a common endpoint are of different colors. Determine the least number of colors for which this is possible combinatoricscombinatorial geometryColoringsegments