In a convex polygon P some diagonals have been drawn, without intersections inside P. Show that there exist at least two vertices of P, neither one of them being an endpoint of any one of those diagonals. combinatorial geometrycombinatoricspolygondiagonals