2023 IOQM/Problem 18

Let P be a convex polygon with 50 vertices. A set F of diagonals of P is said to be minimally friendly if any diagonal d ∈ F intersects at most one other diagonal in F at a point interior to P . Find the largest possible number of elements in a minimally friendly set F