MathDB
max no of diagonals that Maria can draw in such a way inside a regular n-gon

Source: 2020 Colombia day 1 p2

November 27, 2022
combinatoricscombinatorial geometryColoring

Problem Statement

Given a regular nn-sided polygon with n3n \ge 3. Maria draws some of its diagonals in such a way that each diagonal intersects at most one of the other diagonals drawn in the interior of the polygon. Determine the maximum number of diagonals that Maria can draw in such a way.
Note: Two diagonals can share a vertex of the polygon. Vertices are not part of the interior of the polygon.