An Upper Bound for the Number of Planar Lattice Triangulations
Combinatorics
2007-05-23 v1 Metric Geometry
Abstract
We prove an exponential upper bound for the number of all maximal triangulations of the grid: In particular, this improves a result of S. Yu. Orevkov (1999).
Cite
@article{arxiv.math/0212140,
title = {An Upper Bound for the Number of Planar Lattice Triangulations},
author = {Emile E. Anclin},
journal= {arXiv preprint arXiv:math/0212140},
year = {2007}
}
Comments
4 pages, 3 figures