Problem

Source: 2023 Serbia TST Problem 6

Tags: geometry, combinatorial geometry, walls



There are $n^2$ segments in the plane (read walls), no two of which are parallel or intersecting. Prove that there are at least $n$ points in the plane such that no two of them see each other (meaning there is a wall separating them).