A Combinatorial Theorem in Plane Geometry: Every n-Triangulation Can Be Partitioned into at Most ⌊n/3⌋ FansResearch Paper
In a conversation reported by Chvátal, Victor Klee asked for the smallest number such that every region bounded by a simple closed -gon is dominated by points: every point of the region sees one of them along a segment inside the region. In the picturesque language that gave the problem its name, is the number of guards needed to watch any ar…