English
Related papers

Related papers: Generic method for bijections between blossoming t…

200 papers

We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…

Combinatorics · Mathematics 2022-11-28 Éric Fusy , Emmanuel Guitter

We consider maps on orientable surfaces. A map is called \emph{unicellular} if it has a single face. A \emph{covered map} is a map (of genus $g$) with a marked unicellular spanning submap (which can have any genus in $\{0,1,...,g\}$). Our…

Combinatorics · Mathematics 2012-03-14 Olivier Bernardi , Guillaume Chapuy

This article presents unified bijective constructions for planar maps, with control on the face degrees and on the girth. Recall that the girth is the length of the smallest cycle, so that maps of girth at least $d=1,2,3$ are respectively…

Combinatorics · Mathematics 2012-06-13 Olivier Bernardi , Eric Fusy

In 1997, Schaeffer described a bijection between Eulerian planar maps and some trees. In this work we generalize his work to a bijection between bicolorable maps on a surface of any fixed genus and some unicellular maps with the same genus.…

Combinatorics · Mathematics 2018-06-08 Mathias Lepoutre

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…

Combinatorics · Mathematics 2020-04-09 Luis Fredes , Avelio Sepúlveda

We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we…

Combinatorics · Mathematics 2019-06-14 Olivier Bernardi , Eric Fusy

We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…

Combinatorics · Mathematics 2022-08-02 Maciej Dołęga , Mathias Lepoutre

The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the sixties. Following the bijective approach initiated by Cori and…

Combinatorics · Mathematics 2010-06-29 Guillaume Chapuy , Michel Marcus , Gilles Schaeffer

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…

Combinatorics · Mathematics 2007-05-23 J. Bouttier , P. Di Francesco , E. Guitter

We develop a new bijective framework for the enumeration of bipartite planar maps with control on the degree distribution of black and white vertices. Our approach builds on the blossoming-tree paradigm, introducing a family of orientations…

Combinatorics · Mathematics 2025-11-07 Marie Albenque , Laurent Ménard , Nicolas Tokka

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…

Combinatorics · Mathematics 2014-03-21 Guillaume Chapuy , Valentin Féray , Eric Fusy

Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the…

Combinatorics · Mathematics 2017-09-19 Helmut Prodinger

A unicellular map is a map which has only one face. We give a bijection between a dominant subset of rooted unicellular maps of fixed genus and a set of rooted plane trees with distinguished vertices. The bijection applies as well to the…

Combinatorics · Mathematics 2012-03-15 Guillaume Chapuy

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…

Combinatorics · Mathematics 2019-11-01 Baptiste Louf

We unify and extend previous bijections on plane quadrangulations to bipartite and quasibipartite plane maps. Starting from a bipartite plane map with a distinguished edge and two distinguished corners (in the same face or in two different…

Combinatorics · Mathematics 2018-12-21 Jérémie Bettinelli

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…

Combinatorics · Mathematics 2018-07-12 Michael Wallner

We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d…

Combinatorics · Mathematics 2019-12-03 Éric Fusy , Benjamin Lévêque

A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are…

Combinatorics · Mathematics 2026-02-12 Nathan Pagliaroli

A unicellular map, or one-face map, is a graph embedded in an orientable surface such that its complement is a topological disk. In this paper, we give a new viewpoint to the structure of these objects, by describing a decomposition of any…

Combinatorics · Mathematics 2012-03-15 Guillaume Chapuy

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…

Combinatorics · Mathematics 2017-12-15 Olivier Bernardi , Éric Fusy
‹ Prev 1 2 3 10 Next ›