Problem

Source: Latvian TST for Baltic Way 2022 P8

Tags: combinatorics, combinatorial geometry



Call the intersection of two segments almost perfect if for each of the segments the distance between the midpoint of the segment and the intersection is at least $2022$ times smaller than the length of the segment. Prove that there exists a closed broken line of segments such that every segment intersects at least one other segment, and every intersection of segments is almost perfect.