A bijection between 2-triangulations and pairs of non-crossing Dyck paths

Authors:
Sergi Elizalde
Affiliations:
Department of Mathematics, Dartmouth College, Hanover, NH 03755, USA
Venue:
Journal of Combinatorial Theory Series A
Year:
2007

Citing 5
Cited 0

Enumerative combinatorics

Enumerative combinatorics
A Tura´n-type theorem on chords of a convex polygon

Journal of Combinatorial Theory Series B
A generalization of diagonal flips in a convex polygon

Theoretical Computer Science
On line arrangements in the hyperbolic plane

European Journal of Combinatorics
Generalized triangulations and diagonal-free subsets of stack polyominoes

Journal of Combinatorial Theory Series A

Quantified Score

Hi-index	0.00

Visualization

Abstract

A k-triangulation of a convex polygon is a maximal set of diagonals so that no k+1 of them mutually cross in their interiors. We present a bijection between 2-triangulations of a convex n-gon and pairs of non-crossing Dyck paths of length 2(n-4). This solves the problem of finding a bijective proof of a result of Jonsson for the case k=2. We obtain the bijection by constructing isomorphic generating trees for the sets of 2-triangulations and pairs of non-crossing Dyck paths.