BG-MO 2019 Problem 5
Let be a gon, such that no three of its diagonals concur at an internal point. We will call each internal intersection point of diagonals of a knot. What is the greatest number of knots one can choose, such that there doesn't exist a cycle of chosen knots? ( Every two adjacent knots in a cycle must be on the same diagonal and on every diagonal there are at most two knots from a cycle.)
Dataset text AI-MO AoPS. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.