MathDB

Let

n

points, where there are not

3

of them on a line, and consider the segments that are formed by connecting any

2

of the points. There are enough colors available to paint the points and the segments, coloring them with the following two rules: a) All the segments that reach the same point are painted of different colors. b) Each point is painted a different color to all the segments that reach it. Find the minimum number of colors needed to make such a coloring.

Problem Statement