Related papers: A bijection for triangulations, quadrangulations, …

We consider unicellular maps, or polygon gluings, of fixed genus. A few years ago the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for…

We give a general construction of triangulations starting from a walk in the quarter plane with small steps, which is a discrete version of the mating of trees. We use a special instance of this construction to give a bijection between maps…

The search for universality in random triangulations of manifolds, like those featuring in (Euclidean) Dynamical Triangulations, is central to the random geometry approach to quantum gravity. In case of the 3-sphere, or any other manifold…

We continue the study of straightening maps for the family of polynomials of degree $d \ge 3$. The notion of straightening map is originally introduced by Douady and Hubbard to study relationship between polynomial-like renormalizations and…

We consider $p$-orientations, which are defined to be orientations of $d$-regular graphs such that every vertex either has in-degree $p$ or out-degree $p$. These generalise the orientations considered in Jaeger's conjecture, where $d=4p+1$.…

In this article, we study the geometric realizations of $m$-cluster categories of Dynkin types A, D, $\tilde{A}$ and $\tilde{D}$. We show, in those four cases, that there is a bijection between $(m+2)$-angulations and isoclasses of basic…

This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two…

We present a simple bijection between Baxter permutations of size $n$ and plane bipolar orientations with n edges. This bijection translates several classical parameters of permutations (number of ascents, right-to-left maxima,…

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

We study the counting problem of rigid quadrangulations, recently introduced by Budd and proven to be in bijection with colorful quadrangulations. The generating function for the latter has been derived in an algebraic manner by…

Plane increasing trees are rooted labeled trees embedded into the plane such that the sequence of labels is increasing on any branch starting at the root. Relaxed binary trees are a subclass of unlabeled directed acyclic graphs. We…

Multi-edge trees as introduced in a recent paper of Dziemia\'nczuk are plane trees where multiple edges are allowed. We first show that $d$-ary multi-edge trees where the out-degrees are bounded by $d$ are in bijection with classical…

An ear in a triangulation $T$ of a convex $n$-gon $P$ is a triangle of $T$ that shares two sides with $P$ itself. Certain enumerational and structural problems become easier when one considers only triangulations with few ears. We…

The Longest Edge Bisection of a triangle is performed by joining the midpoint of its longest edge to the opposite vertex. Applying this procedure iteratively produces an infinite family of triangles. Surprisingly, a classical result of…

A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges…

We survey basic properties and bounds for $q$-equivelar and $d$-covered triangulations of closed surfaces. Included in the survey is a list of the known sources for $q$-equivelar and $d$-covered triangulations. We identify all orientable…

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

A rectangulation is a tiling of a rectangle by a finite number of rectangles. The rectangulation is called generic if no four of its rectangles share a single corner. We initiate the enumeration of generic rectangulations up to…

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 orientations with…

A rectangulation is a decomposition of a rectangle into finitely many rectangles. Via natural equivalence relations, rectangulations can be seen as combinatorial objects with a rich structure, with links to lattice congruences, flip graphs,…