Title of article
An upper bound for the number of planar lattice triangulations
Author/Authors
Anclin، نويسنده , , Emile E.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2003
Pages
4
From page
383
To page
386
Abstract
We prove an exponential upper bound for the number f(m,n) of all maximal triangulations of the m×n grid:f(m,n)<23mn.In particular, this improves a result of S.Yu. Orevkov [2].
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2003
Journal title
Journal of Combinatorial Theory Series A
Record number
1530831
Link To Document