arXiv:math/0601747 [math.CO]AbstractReferencesReviewsResources
On the Number of Pseudo-Triangulations of Certain Point Sets
Oswin Aichholzer, David Orden, Francisco Santos, Bettina Speckmann
Published 2006-01-31, updated 2007-06-14Version 2
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically $12^n n^{\Theta(1)}$ pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far.
Comments: 31 pages, 11 figures, 4 tables. Not much technical changes with respect to v1, except some proofs and statements are slightly more precise and some expositions more clear. This version has been accepted in J. Combin. Th. A. The increase in number of pages from v1 is mostly due to formatting the paper with "elsart.cls" for Elsevier
Journal: J. Combin. Theory Ser. A, 115 (2008) 254-278.
Categories: math.CO
Keywords: planar point set, monotonicity conjecture, prominent families, maximum number, double circle
Tags: journal article
Related articles: Most relevant | Search more
arXiv:math/0601767 [math.CO] (Published 2006-01-31)
Empty Rectangles and Graph Dimension
The maximum number of cliques in a graph embedded in a surface
arXiv:1212.3505 [math.CO] (Published 2012-12-14)
On the Maximum Number of k-Hooks of Partitions of n