Mathematics – Combinatorics
Scientific paper
2002-12-10
Mathematics
Combinatorics
4 pages, 3 figures
Scientific paper
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).
No associations
LandOfFree
An Upper Bound for the Number of Planar Lattice Triangulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with An Upper Bound for the Number of Planar Lattice Triangulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An Upper Bound for the Number of Planar Lattice Triangulations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-75223