English

Enumerating planar stuffed maps as hypertrees of mobiles

Combinatorics 2026-02-12 v2

Abstract

A planar stuffed map is an embedding of a graph into the 2-sphere S2S^{2}, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are each homeomorphic to S2S^{2} with multiple boundaries. This is a generalization of planar maps whose complement of the graph is a collection of disjoint topologically connected components that are each homeomorphic to a disc. The main goal of this work is to construct a bijection between bipartite planar stuffed maps and collections of integer-labelled trees connected by hyperedges such that they form a hypertree, called hypermobiles. This bijection directly generalizes the Bouttier-Di Franceso-Guitter bijection between bipartite planar maps and mobiles. Additionally, we show that the generating functions of these trees of mobiles satisfy both an algebraic equation, generalizing the case of ordinary planar maps, and a new functional equation. As an example, we explicitly enumerate a class of stuffed quadrangulations.

Keywords

Cite

@article{arxiv.2506.06086,
  title  = {Enumerating planar stuffed maps as hypertrees of mobiles},
  author = {Nathan Pagliaroli},
  journal= {arXiv preprint arXiv:2506.06086},
  year   = {2026}
}

Comments

28 pages, 5 figures