An Upper Bound for the Number of Planar Lattice Triangulations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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).
4 pages, 3 figures

Keywords

Combinatorics, Metric Geometry, 05A16; 05C30

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/65944

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0212140
 http://arxiv.org/abs/math/0212140

Collections

arXiv