A bijection for loopless triangulations of a polygon with interior points - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

A bijection for loopless triangulations of a polygon with interior points

Abstract

Loopless triangulations of a polygon with $k$ vertices in $k+2n$ triangles (with interior points and possibly multiple edges) were enumerated by Mullin in 1965, using generating functions and calculations with the quadratic method. In this article we propose a simple bijective construction of Mullin's formula. The argument rests on \emph{conjugation of trees}, a variation of the cycle lemma designed for planar maps. In the much easier case of loopless triangulations of the sphere ($k=3$), we recover and prove correct an unpublished construction of the second author.

Domains

Other [cs.OH]
Not file

Dates and versions

inria-00100860 , version 1 (26-09-2006)

Identifiers

  • HAL Id : inria-00100860 , version 1

Cite

Dominique Poulalhon, Gilles Schaeffer. A bijection for loopless triangulations of a polygon with interior points. International Conference on Formal Power Series and Algebraic Combinatorics - FPSAC'02, Foda, O. and Guttmann, T., Jul 2002, Melbourne, Australie, France. 12 p. ⟨inria-00100860⟩
86 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More