Putnam 2007 A6
- Session A
A triangulation of a polygon is a finite collection of triangles whose union is , 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 . Say that is admissible if every internal vertex is shared by 6 or more triangles. For example, [figure omitted.] Prove that there is an integer , depending only on , such that any admissible triangulation of a polygon with sides has at most 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.