A bijective census of nonseparable planar maps

DOI10.1006/jcta.1997.2852zbMath0916.05037OpenAlexW1981761788WikidataQ114234209 ScholiaQ114234209MaRDI QIDQ1268599

Gilles Schaeffer, Benjamin Jacquard

Publication date: 19 July 1999

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

Full work available at URL: https://semanticscholar.org/paper/5db54fc23975cd4f352b02bc6814ac7c152c27a1

zbMATH Keywords

enumerationsplanar map

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items

Eulerian polynomials and descent statistics, A bijection for triangulations of a polygon with interior points and multiple edges, Fighting fish and two-stack sortable permutations, An axiomatic characterization of the Brownian map, Lattice paths and \((n - 2)\)-stack sortable permutations, An involution on \(\beta (1,0)\)-trees, On the real-rootedness of the descent polynomials of \((n-2)\)-stack sortable permutations, A note on irreducible maps with several boundaries, Bijections between fighting fish, planar maps, and Tamari intervals, A trinity of duality: non-separable planar maps, \(\beta(1,0)\)-trees and synchronized intervals, Fighting fish, The two-point function of bicolored planar maps, A bijection between Tamari intervals and extended fighting fish, Simple maps, Hurwitz numbers, and topological recursion, Asymptotic normality in t-stack sortable permutations, The enumeration of generalized Tamari intervals, Fighting fish: enumerative properties, Unnamed Item, Enumeration of fixed points of an involution on \(\beta(1,0)\)-trees, Decompositions and statistics for \(\beta \)(1,0)-trees and nonseparable permutations, On linear transformations preserving the Pólya frequency property, Stack words and a bound for 3-stack sortable permutations, Left ternary trees and non-separable rooted planar maps, New bijective links on planar maps via orientations, Symmetry and unimodality in \(t\)-stack sortable permutations, A simplicial complex of 2-stack sortable permutations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length \(n\) is \(2(3n)\)!/(\((n+1)\)!\((2n+1)\)!)
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• A combinatorial proof of J. West's conjecture
• Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
• A Census of Planar Maps
• Enumeration of Non-Separable Planar Maps
• On the Enumeration of Rooted Non-Separable Planar Maps