olymmath

OMM 1991 Problem 6

    Given an nn -gon ( n≥4n\ge 4 ), consider a set TT 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 TT contains at most nn 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.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator mx-omm/1991/p6 · Tag Z81MZY65YR · Edit this page on GitHub · Keys: j next, k previous