Problem

Source: SAMO 2016 Q4

Tags: combinatorics



For which integers $n \geq 2$ is it possible to draw $n$ straight lines in the plane in such a way that there are at least $n - 2$ points where exactly three of the lines meet?