An upper bound for the number of planar lattice triangulations

DOI10.1016/S0097-3165(03)00097-9zbMath1022.05002arXivmath/0212140OpenAlexW2019686728MaRDI QIDQ1406750

Emile E. Anclin

Publication date: 7 September 2003

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0212140

zbMATH Keywords

unimodular triangulations

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (6)

Skyscraper polytopes and realizations of plane triangulations ⋮ Bounding the Kreuzer‐Skarke Landscape ⋮ Counting polygon triangulations is hard ⋮ A Lyapunov function for Glauber dynamics on lattice triangulations ⋮ Unnamed Item ⋮ Random lattice triangulations: structure and algorithms

Cites Work

• Asymptotic number of triangulations with vertices in \(\mathbb{Z}^2\)
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound for the number of planar lattice triangulations