olymmath

Putnam 2007 A6

  • Session A

A triangulation T\mathcal{T} of a polygon PP is a finite collection of triangles whose union is PP, and such that the intersection of any two triangles is either empty, or a shared vertex, or a shared side. Moreover, each side is a side of exactly one triangle in T\mathcal{T}. Say that T\mathcal{T} is admissible if every internal vertex is shared by 6 or more triangles. For example, [figure omitted.] Prove that there is an integer MnM_n, depending only on nn, such that any admissible triangulation of a polygon PP with nn sides has at most MnM_n triangles.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava, Kiran Kedlaya and Lenny Ng

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

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

Locator putnam/2007/a6 · Tag H81J441RV4 · Edit this page on GitHub · Keys: j next, k previous