MathDB
n points on a circle

Source: Polish MO Finals 1965 p3

August 30, 2024
geometrycombinatoricscombinatorial geometrypoints

Problem Statement

n>2 n > 2 points are chosen on a circle and each of them is connected to every other by a segment. Is it possible to draw all of these segments in one sequence, i.e. so that the end of the first segment is the beginning of the second, the end of the second - the beginning of the third, etc., and so that the end of the last segment is the beginning of the first?