MathDB
Combinatorial geometry featuring walls

Source: 2023 Serbia TST Problem 6

May 22, 2023
geometrycombinatorial geometrywalls

Problem Statement

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