On the number of fair triangulations (Q1569955)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1471197
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of fair triangulations |
scientific article; zbMATH DE number 1471197 |
Statements
On the number of fair triangulations (English)
0 references
9 July 2000
0 references
A triangulation is a rooted planar map all of whose faces are 3-gons. A triangulation is called fair if it has no loop and the root-edge is not part of a multiple edge. This paper gives a formula for the number of fair triangulations with \(3m\) edges and uses this formula to enumerate several other kinds of triangulations.
0 references
enumeration
0 references
Lagrangian inversion
0 references
triangulation
0 references
rooted planar map
0 references
0.7681736350059509
0 references
0.7669631242752075
0 references
