A bijective topological recursion for maps
We prove bijectively a recursive excision formula for maps of arbitrary topology. This yields the topological recursion formulae governing their enumeration, already at the level of formal generating series and without any analyticity assumption. We extend the result to maps carrying self-avoiding loop models and to stuffed maps, i.e. a variant of maps allowing faces of arbitrary topology. Our results give a precise combinatorial meaning to all terms of the (blobbed) topological recursion known for (stuffed) maps, including the recursion kernel, which had so far been missing. The construction relies on the simple idea of iterating Tutte's algorithm until the topology changes. Equivalently, it can be interpreted as a pair-of-pants decomposition driven by a path issuing from the root of the first boundary, providing an analogue for maps of the Mirzakhani-McShane identity for hyperbolic surfaces.