An Upper Bound for the Number of Planar Lattice Triangulations

2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/65944We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).4 pages, 3 figuresCombinatoricsMetric Geometry05A16; 05C30An Upper Bound for the Number of Planar Lattice Triangulationstext