Enumeration of Tree-like Maps with Arbitrary Number of Vertices
Combinatorics
2017-02-10 v1
Abstract
This paper provides the generating series for the embedding of tree-like graphs of arbitrary number of vertices, accourding to their genus. It applies and extends the techniques of Chan, where it was used to give an alternate proof of the Goulden and Slofstra formula. Furthermore, this greatly generalizes the famous Harer-Zagier formula, which computes the Euler characteristic of the moduli space of curves, and is equivalent to the computation of one vertex maps.
Keywords
Cite
@article{arxiv.1702.02723,
title = {Enumeration of Tree-like Maps with Arbitrary Number of Vertices},
author = {Aaron Chun Shing Chan},
journal= {arXiv preprint arXiv:1702.02723},
year = {2017}
}
Comments
arXiv admin note: text overlap with arXiv:1702.02305