A bijection between 2-triangulations and pairs of non-crossing Dyck paths
From MaRDI portal
Publication:2459500
DOI10.1016/j.jcta.2007.03.002zbMath1125.05006arXivmath/0610235OpenAlexW2043833719MaRDI QIDQ2459500
Publication date: 7 November 2007
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0610235
Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
A bijection between a set of lexicographic semiorders and pairs of non-crossing Dyck paths, Symmetries of statistics on lattice paths between two boundaries, Hook Formulas for Skew Shapes II. Combinatorial Proofs and Enumerative Applications, Increasing and decreasing sequences in fillings of moon polyominoes, Multitriangulations as complexes of star polygons
Cites Work
- Unnamed Item
- Unnamed Item
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Binomial determinants, paths, and hook length formulae
- A Turán-type theorem on chords of a convex polygon
- \(4n-10\)
- On line arrangements in the hyperbolic plane
- A generalization of diagonal flips in a convex polygon
- A bijection between realizers of maximal plane graphs and pairs of non-crossing Dyck paths
- Generalized triangulations and diagonal-free subsets of stack polyominoes
- Crossings and nestings of matchings and partitions
- On the Vector Representations of Induced Matroids