On the Number of α-Orientations

We deal with the asymptotic enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings, and ice models. The notion of an α-orientation unifies many different combinatorial structures, including the afore mentioned. We ask for the number of αorientations and also for special instances thereof, such as Schnyder woods and bipolar orientations. The main focus of this paper are bounds for the maximum number of such structures that a planar map with n vertices can have. We give examples of triangulations with 2.37n Schnyder woods, 3-connected planar maps with 3.209n Schnyder woods and inner triangulations with 2.91n bipolar orientations. These lower bounds are accompanied by upper bounds of 3.56n, 8n and 3.97n respectively. We also show that for any planar map M and any α the number of α-orientations is bounded from above by 3.73n and present a family of maps which have at least 2.598n α-orientations for n big enough.

[1]  Stefan Felsner,et al.  Convex Drawings of 3-Connected Plane Graphs , 2004, SODA '05.

[2]  Stefan Felsner,et al.  Lattice Structures from Planar Graphs , 2004, Electron. J. Comb..

[3]  Nicolas Bonichon,et al.  A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths , 2005, Discret. Math..

[4]  Eric Vigoda,et al.  A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries , 2001, STOC '01.

[5]  R. J. Baxter,et al.  F Model on a Triangular Lattice , 1969 .

[6]  Gnter Rote,et al.  The number of spanning trees in a planar graph , 2005 .

[7]  Elliott H. Lleb.  Residual Entropy of Square Ice , 1967 .

[8]  Éric Fusy,et al.  Dissections and trees, with applications to optimal mesh encoding and to random sampling , 2005, SODA '05.

[9]  Walter Schnyder,et al.  Embedding planar graphs on the grid , 1990, SODA '90.

[10]  H. de Fraysseix,et al.  On topological aspects of orientations , 2001, Discret. Math..

[11]  Roberto Tamassia,et al.  A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..

[12]  Stefan Felsner,et al.  Convex Drawings of Planar Graphs and the Order Dimension of 3-Polytopes , 2001, Order.

[13]  W. T. Tutte.  A Short Proof of the Factor Theorem for Finite Graphs , 1954, Canadian Journal of Mathematics.

[14]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.

[15]  W. Schnyder.  Planar graphs and poset dimension , 1989 .

[16]  Robin Thomas,et al.  PERMANENTS, PFAFFIAN ORIENTATIONS, AND EVEN DIRECTED CIRCUITS , 1997, STOC 1997.

[17]  David Bruce Wilson,et al.  Trees and Matchings , 2000, Electron. J. Comb..

[18]  Stefan Felsner,et al.  Geometric Graphs and Arrangements , 2004 .

[19]  Michael Luby,et al.  Approximating the Permanent of Graphs with Large Factors , 1992, Theor. Comput. Sci..

[20]  Patrice Ossona de Mendez,et al.  Bipolar orientations Revisited , 1995, Discret. Appl. Math..