Related papers: A note on irreducible maps with several boundaries
We derive an efficient way to obtain generating functions of bipartite maps of arbitrary genus and boundary length using a spectral curve as initial data for the framework of topological recursion. Based on an earlier result of Chapuy and…
We present an unexpected connection between two map enumeration problems. The first one consists in counting planar maps with a boundary of prescribed length. The second one consists in counting planar maps with two points at a prescribed…
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have…
We study bipartite maps on the plane with one infinite face and one face of perimeter 2. At first we consider the problem of their enumeration an then study the connection between the combinatorial structure of a map and the degree of its…
We settle a problem of Dujmovi\'c, Eppstein, Suderman, and Wood by showing that there exists a function $f$ with the property that every planar graph $G$ with maximum degree $d$ admits a drawing with noncrossing straight-line edges, using…
We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
We characterize the generating function of bipartite planar maps counted according to the degree distribution of their black and white vertices. This result is applied to the solution of the hard particle and Ising models on random planar…
We study the local limits of uniform high genus bipartite maps with prescribed face degrees. We prove the convergence towards a family of infinite maps of the plane, the q-IBPMs, which exhibit both a spatial Markov property and a hyperbolic…
We establish a simple recurrence formula for the number $Q_g^n$ of rooted orientable maps counted by edges and genus. We also give a weighted variant for the generating polynomial $Q_g^n(x)$ where $x$ is a parameter taking the number of…
We study the geodesic two- and three-point functions of random weighted cubic maps, which are obtained by assigning random edge lengths to random cubic planar maps. Explicit expressions are obtained by taking limits of recently established…
We enumerate weighted graphs with a certain upper bound condition. We also compute the generating function of the numbers of these graphs, and prove that it is a rational function. In particular, we show that if the given graph is a…
We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized…
We introduce bijections between families of rooted maps with unfixed genus and families of so-called blossoming trees endowed with an arbitrary forward matching of their leaves. We first focus on Eulerian maps with controlled vertex…
We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…
A tight map is a map with some of its vertices marked, such that every vertex of degree $1$ is marked. We give an explicit formula for the number $N_{0,n}(d_1,\ldots,d_n)$ of planar tight maps with $n$ labeled faces of prescribed degrees…
In this note, we examine how the BKP structure of the generating series of several models of maps on non-oriented surfaces can be used to obtain explicit and/or efficient recurrence formulas for their enumeration according to the genus and…
We obtain explicit upper bounds for the number of irreducible factors for a class of compositions of polynomials in several variables over a given field. In particular, some irreducibility criteria are given for this class of compositions…
Beyond-planarity focuses on combinatorial properties of classes of non-planar graphs that allow for representations satisfying certain local geometric or topological constraints on their edge crossings. Beside the study of a specific graph…