Unified bijections for maps with prescribed degrees and girth

DOI10.1016/j.jcta.2012.03.007zbMath1242.05124arXiv1102.3619OpenAlexW2073442617MaRDI QIDQ423656

Éric Fusy, Olivier Bernardi

Publication date: 4 June 2012

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1102.3619

zbMATH Keywords

countingplanar mapsmaster bijection

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30)

Related Items (18)

Compact Brownian surfaces ⋮ Bijective proof of the rationality of the generating series of higher-genus maps ⋮ On polynomials counting essentially irreducible maps ⋮ Irreducible metric maps and Weil-Petersson volumes ⋮ Percolation on Triangulations: A Bijective Path to Liouville Quantum Gravity ⋮ Growing uniform planar maps face by face ⋮ A note on irreducible maps with several boundaries ⋮ A simple formula for the series of constellations and quasi-constellations with boundaries ⋮ Blossoming bijection for higher-genus maps ⋮ Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants ⋮ Unified bijections for maps with prescribed degrees and girth ⋮ What is a random surface? ⋮ A bijection for triangulations, quadrangulations, pentagulations, etc. ⋮ A bijection for essentially 4-connected toroidal triangulations ⋮ A generic method for bijections between blossoming trees and planar maps ⋮ A bijection for rooted maps on general surfaces ⋮ Bijections for planar maps with boundaries ⋮ Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth

Cites Work

• Unnamed Item
• Unnamed Item
• Unified bijections for maps with prescribed degrees and girth
• A bijection for covered maps, or a shortcut between Harer-Zagiers and Jacksons formulas
• A bijection for triangulations, quadrangulations, pentagulations, etc.
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Optimal coding and sampling of triangulations
• Bijective counting of tree-rooted maps and shuffles of parenthesis systems
• Intervals in Catalan lattices and realizers of triangulations
• Transversal structures on triangulations: A combinatorial study and straight-line drawings
• Les hypercartes planaires sont des arbres très bien étiquetés. (Planar hypermaps are well-labeled trees)
• Counting rooted maps by genus. III: Nonseparable maps
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Planar maps as labeled mobiles
• Planar diagrams
• A bijection for triangulations of a polygon with interior points and multiple edges
• Schnyder decompositions for regular plane graphs and application to drawing
• Polynomial equations with one catalytic variable, algebraic series and map enumeration
• On the number of intervals in Tamari lattices
• Planar Maps are Well Labeled Trees
• A Census of Planar Triangulations
• Blocked edges on Eulerian maps and mobiles: application to spanning trees, hard particles and the Ising model
• A Census of Slicings
• The Number of Degree-Restricted Rooted Maps on the Sphere
• A Character Theoretic Approach to Embeddings of Rooted Maps in an Orientable Surface of Given Genus
• Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
• A Census of Planar Maps

This page was built for publication: Unified bijections for maps with prescribed degrees and girth