Related papers: A note on irreducible maps with several boundaries
We discuss the enumeration of planar graphs using bijections with suitably decorated trees, which allow for keeping track of the geodesic distances between faces of the graph. The corresponding generating functions obey non-linear recursion…
We present unified bijections for maps on the torus with control on the face-degrees and essential girth (girth of the periodic planar representation). A first step is to show that for d>=3 every toroidal d-angulation of essential girth d…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
We consider maps with tight boundaries, i.e. maps whose boundaries have minimal length in their homotopy class, and discuss the properties of their generating functions $T^{(g)}_{\ell_1,\ldots,\ell_n}$ for fixed genus $g$ and prescribed…
We perform the asymptotic enumeration of two classes of rooted maps on orientable surfaces of genus g: m-hypermaps and m-constellations. For m=2, they correspond respectively to maps with even face degrees and bipartite maps. We obtain…
We obtain first order linear partial differential equations which are satisfied by exponential generating functions of two variables for the number of connected bipartite graphs with given Betti number. By solving these equations…
We give explicit formulas enumerating 4-regular labelled and unlabelled one-face maps.
We obtain simple generating sets for various mapping class groups of a nonorientable surface with punctures and/or boundary. We also compute the abelianizations of these mapping class groups.
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
We prove that every (possibly infinite) graph of degree at most $d$ has a 4-dependent random proper $4^{d(d+1)/2}$-coloring, and one can construct it as a finitary factor of iid. For unimodular transitive (or unimodular random) graphs we…
We present algorithms for parametrizing by radicals an irreducible curve, not necessarily plane, when the genus is less o equal to 4 and they are defined over an algebraically closed field of characteristic zero. In addition, we also…
We address the enumeration of q-coloured planar maps counted bythe number of edges and the number of monochromatic edges. We prove that the associated generating function is differentially algebraic,that is, satisfies a non-trivial…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers…
Let $G$ be a bipartite graph without loops and multiple edges on $v\ge 4$ vertices, which can be drawn on the plane such that any edge intersects at most one other edge. We prove that such graph has at most $3v-8$ edges for even $v\ne 6$…
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…
In this note we consider $k$-regular multigraphs, where the possible edge multiplicities are controlled. These structures are considered in a question recently posed by Brendan McKay. We express the generating functions using the scalar…
We show that specific exponential bivariate integrals serve as generating functions of labeled edge-bicolored graphs. Based on this, we prove an asymptotic formula for the number of regular edge-bicolored graphs with arbitrary weights…
Beyond-planarity focuses on the study of geometric and topological graphs that are in some sense nearly-planar. Here, planarity is relaxed by allowing edge crossings, but only with respect to some local forbidden crossing configurations.…
In this paper we present a class of four-dimensional bi-rational maps with two invariants satisfying certain constraints on degrees. We discuss the integrability properties of these maps from the point of view of degree growth and Liouville…