Question 172
Consider 2017 lines in the plane which pairwise meet at distinct points. Let $E$ be the set of these intersection points.
We want to assign a color to each point of $E$ so that any two of these points which lie on the same line and whose connecting segment contains no other point of $E$ have different colors.
What is the minimum number of colors needed to make such a coloring possible?
We want to assign a color to each point of $E$ so that any two of these points which lie on the same line and whose connecting segment contains no other point of $E$ have different colors.
What is the minimum number of colors needed to make such a coloring possible?