Explicit enumeration of triangulations with multiple boundaries
From MaRDI portal
Abstract: We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.
Recommendations
Cited in
(23)- The enumeration of akempic triangulations
- The number of geometric bistellar neighbors of a triangulation
- The hyperbolic Brownian plane
- Random planar maps and growth-fragmentations
- A bijection for triangulations of a polygon with interior points and multiple edges
- Infinite geodesics in hyperbolic random triangulations
- Simple maps, Hurwitz numbers, and topological recursion
- Local limits of uniform triangulations in high genus
- Tree-decorated planar maps
- Percolations on random maps. I: Half-plane models
- The mesoscopic geometry of sparse random maps
- scientific article; zbMATH DE number 1829310 (Why is no real title available?)
- A simple formula for the series of constellations and quasi-constellations with boundaries
- Boundaries of random triangulation of a disk
- On the mixing time of the flip walk on triangulations of the sphere
- Enumerating triangulations by parallel diagonals
- Multi-ended Markovian triangulations and robust convergence to the UIPT
- Topological recursion for fully simple maps from ciliated maps
- Enumerating simplicial decompositions of surfaces with boundaries
- Spatial Markov property in Brownian disks
- Drilling holes in the Brownian disk: the Brownian annulus
- Bijections for planar maps with boundaries
- Percolation on random triangulations and stable looptrees
This page was built for publication: Explicit enumeration of triangulations with multiple boundaries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010620)