Problem

Source:

Tags: geometry, combinatorics, combinatorial geometry



There are $2n+1$ segments on the line. Any segment intersects at with at least $n$ others. Prove that there is a segment that intersects all the others.