相关论文: Limit Laws of Planar Maps with Prescribed Vertex 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 prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees…

We get central limit type theorems for the total number of edges in the generalized random graphs with random vertex weights under different moment conditions on distributions of the weights.

We determine the maximum number of edges that a planar graph can have as a function of its maximum degree and matching number.

We deal with the asymptotic enumeration of combinatorial structures on planar maps. Prominent instances of such problems are the enumeration of spanning trees, bipartite perfect matchings, and ice models. The notion of orientations with…

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical…

We prove some asymptotic results for the radius and the profile of large random rooted planar maps with faces of arbitrary degrees. Using a bijection due to Bouttier, Di Francesco and Guitter between rooted planar maps and certain four-type…

Let P_{n,d,D} denote the graph taken uniformly at random from the set of all labelled planar graphs on {1,2,...,n} with minimum degree at least d(n) and maximum degree at most D(n). We use counting arguments to investigate the probability…

For any fixed integer $R \geq 2$ we characterise the typical structure of undirected graphs with vertices $1, ..., n$ and maximum degree $R$, as $n$ tends to infinity. The information is used to prove that such graphs satisfy a labelled…

We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…

One proves a far-reaching upper bound for the degree of a generically finite rational map between projective varieties over a base field of arbitrary characteristic. The bound is expressed as a product of certain degrees that appear…

We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.

We prove that the maximum degree $\Delta_n$ of a random series-parallel graph with $n$ vertices satisfies $\Delta_n/\log n \to c$ in probability, and $\mathbb{E}\, \Delta_n \sim c \log n$ for a computable constant $c>0$. The same result…

We show that in $\text{O}(D)$ invariant matrix theories containing a large number $D$ of complex or Hermitian matrices, one can define a $D\rightarrow\infty$ limit for which the sum over planar diagrams truncates to a tractable, yet…

We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…

Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…

In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…

Given a set D of nonnegative integers, we derive the asymptotic number of graphs with a givenvnumber of vertices, edges, and such that the degree of every vertex is in D. This generalizes existing results, such as the enumeration of graphs…

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 solve three enumerative problems concerning families of planar maps. More precisely, we establish algebraic equations for the generating function of non-separable triangulations in which all vertices have degree at least d, for a certain…