Problem

Source: Bulgarian Winter Tournament 2024 9.4

Tags: combinatorics, combinatorial geometry, Recurrence



There are $11$ points equally spaced on a circle. Some of the segments having endpoints among these vertices are drawn and colored in two colors, so that each segment meets at an internal for it point at most one other segment from the same color. What is the greatest number of segments that could be drawn?