Problem

Source: Russian TST 2018, Day 8 P3 (Group NG); thank you, Fedor Bakharev, for the translation

Tags: combinatorics, graph theory, vector geometry, physics



A spider built a web on the unit circle. The web is a planar graph with straight edges inside the circle, bounded by the circumference of the circle. Each vertex of the graph lying on the circle belongs to a unique edge, which goes perpendicularly inward to the circle. For each vertex of the graph inside the circle, the sum of the unit outgoing vectors along the edges of the graph is zero. Prove that the total length of the web is equal to the number of its vertices on the circle.