Explicit enumeration of triangulations with multiple boundaries
Combinatorics
2011-11-10 v2
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.
Cite
@article{arxiv.0706.0681,
title = {Explicit enumeration of triangulations with multiple boundaries},
author = {Maxim Krikun},
journal= {arXiv preprint arXiv:0706.0681},
year = {2011}
}