相关论文: Planar triangulations, bridgeless planar maps and …

We introduce a simple bijection between Tamari intervals and the blossoming trees (Poulalhon and Schaeffer, 2006) encoding planar triangulations, using a new meandering representation of such trees. Its specializations to the families of…

The enumeration of linear $\lambda$-terms has attracted quite some attention recently, partly due to their link to combinatorial maps. Zeilberger and Giorgetti (2015) gave a recursive bijection between planar linear normal $\lambda$-terms…

In 2006, Chapoton defined a class of Tamari intervals called "new intervals" in his enumeration of Tamari intervals, and he found that these new intervals are equi-enumerated with bipartite planar maps. We present here a direct bijection…

Generalized Tamari intervals have been recently introduced by Pr\'eville-Ratelle and Viennot, and have been proved to be in bijection with (rooted planar) non-separable maps by Fang and Pr\'eville-Ratelle. We present two new bijections…

This article presents new bijections on planar maps. At first a bijection is established between bipolar orientations on planar maps and specific "transversal structures" on triangulations of the 4-gon with no separating 3-cycle, which are…

The dual of a map is a fundamental construction on combinatorial maps, but many other combinatorial objects also possess their notion of duality. For instance, the Tamari lattice is isomorphic to its order dual, which induces an involution…

We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…

The Stanley lattice, Tamari lattice and Kreweras lattice are three remarkable orders defined on the set of Catalan objects of a given size. These lattices are ordered by inclusion: the Stanley lattice is an extension of the Tamari lattice…

We use a recently introduced combinatorial object, the interval-poset, to describe two bijections on intervals of the Tamari lattice. Both bijections give a combinatorial proof of some previously known results. The first one is an inner…

We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…

This article presents a unified bijective scheme between planar maps and blossoming trees, where a blossoming tree is defined as a spanning tree of the map decorated with some dangling half-edges that enable to reconstruct its faces. Our…

We present a bijection for toroidal maps that are essentially $3$-connected ($3$-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite toroidal maps with all faces of…

We extend Schaeffer's bijection between rooted quadrangulations and well-labeled trees to the general case of Eulerian planar maps with prescribed face valences, to obtain a bijection with a new class of labeled trees, which we call…

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random…

Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…

We present bijections for the planar cases of two counting formulas on maps that arise from the KP hierarchy (Goulden-Jackson and Carrell-Chapuy formulas), relying on a "cut-and-slide" operation. This is the first time a bijective proof is…

Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…

A tanglegram consists of two rooted binary trees and a perfect matching between their leaves, and a planar tanglegram is one that admits a layout with no crossings. We show that the problem of generating planar tanglegrams uniformly at…

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…

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…