An Upper Bound for the Number of Planar Lattice Triangulations
| dc.creator | Anclin, Emile E. | |
| dc.date | 2002-12-10 | |
| dc.date.accessioned | 2026-07-07T04:53:40Z | |
| dc.date.available | 2026-07-07T04:53:40Z | |
| dc.description | We 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). | |
| dc.description | 4 pages, 3 figures | |
| dc.identifier | https://arxiv.org/abs/math/0212140 | |
| dc.identifier | http://arxiv.org/abs/math/0212140 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/65944 | |
| dc.subject | Combinatorics | |
| dc.subject | Metric Geometry | |
| dc.subject | 05A16; 05C30 | |
| dc.title | An Upper Bound for the Number of Planar Lattice Triangulations | |
| dc.type | text |