| Properties of random triangulations and trees (1999) | |||||||||||||||
Abstract | |||||||||||||||
| Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric " features of a triangulation # Tn, for example #n (#) which counts the maximal number of diagonals in # incident to a single vertex of K. It is familiar that Tn is bijectively equivalent to Bn, the set of rooted binary trees with n | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||