A better upper bound on the number of triangulations of a planar point set

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/63710We show that a point set of cardinality $n$ in the plane cannot be the vertex set of more than $59^n O(n^{-6})$ straight-edge triangulations of its convex hull. This improves the previous upper bound of $276.75^n$.6 pages, 1 figureCombinatorics05C10A better upper bound on the number of triangulations of a planar point settext