Explicit enumeration of triangulations with multiple boundaries
classification
🧮 math.CO
keywords
multipletriangulationsboundariesboundarycombinatorialcomponentedgesenumerate
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.