Counting unrooted hypermaps on closed orientable surface

@inproceedings{Mednykh2006CountingUH,
  title={Counting unrooted hypermaps on closed orientable surface},
  author={Alexander Mednykh and Roman Nedela},
  year={2006}
}
In this paper we derive an enumeration formula for the number of hypermaps of given genus g and given number of darts n in terms of the numbers of rooted hypermaps of genus γ ≤ g with m darts , where m|n. Résumé. Dans ce travail on denombre les hypergraphes d’un genus g donné, et un nombr e de fleches n, selon le nombre de hyper cartes de genus γ ≤ g, et av ec m fleches, ou m|n.