MathDB
100-gon with k points, find a 2k-gon

Source: All Russian Math Olympiad 1994

April 3, 2015
combinatoricscombinatorics unsolved

Problem Statement

Inside a convex 100100-gon are selected kk points, 2k502 \leq k \leq 50. Show that one can choose 2k2k vertices of the 100100-gon so that the convex 2k2k-gon determined by these vertices contains all the selected points.