MathNet 2017-part-06 — 176 problems (EN–VI) Question 4

Here are $2017$ points on the plane, no three of them are collinear. Some pairs of the points are connected by $n$ segments. Find the smallest value of $n$ so that there always exists two disjoint segments in any case.