Classic polygon diagonal problem
Source: Austrian-Polish 1978, Problem 9
July 5, 2015
combinatorial geometrycombinatoricspolygondiagonals
Problem Statement
In a convex polygon some diagonals have been drawn, without intersections inside . Show that there exist at least two vertices of , neither one of them being an endpoint of any one of those diagonals.