OMM 1991 Problem 6
Given an -gon ( ), consider a set of triangles formed by vertices of the polygon having the following property: Every two triangles in T have either two common vertices, or none. Prove that contains at most triangles.
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.