An Upper Bound for the Number of Planar Lattice Triangulations
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 (1999).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.