Related papers: The Scaling Limit of Random Outerplanar Maps

We study straight-line drawings of graphs where the vertices are placed in convex position in the plane, i.e., \emph{convex drawings}. We consider two families of graph classes with convex drawings: \emph{outer $k$-planar} graphs, where…

To untangle a geometric graph means to move some of the vertices so that the resulting geometric graph has no crossings. Pach and Tardos [Discrete Comput. Geom., 2002] asked if every n-vertex geometric planar graph can be untangled while…

We prove that the metric space associated with a uniformly distributed planar quadrangulation with n faces and no pendant vertices converges modulo a suitable rescaling to the Brownian map. This is a first step towards the extension of…

We study the scaling limits of looptrees associated with Bienaym\'e--Galton--Watson (BGW) trees, that are obtained by replacing every vertex of the tree by a "cycle" whose size is its degree. First, we consider BGW trees whose offspring…

A rectangular floorplan is a partition of a rectangle into smaller rectangles such that no four rectangles meet at a single point. Rectangular floorplans arise naturally in a variety of applications, including VLSI design, architectural…

We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…

Given metric quotients $S$ and $S_n$, $n \in \mathbb{N}$, of a metric space $X$, sufficient conditions are provided on the data defining them guaranteeing that $S$ is the Gromov-Hausdorff limit of $S_n$. These conditions are recognized…

The bend-number b(G) of a graph G is the minimum k such that G may be represented as the edge intersection graph of a set of grid paths with at most k bends. We confirm a conjecture of Biedl and Stern showing that the maximum bend-number of…

We define some new sequences of recursively constructed random combinatorial trees, and show that, after properly rescaling graph distance and equipping the trees with the uniform measure on vertices, each sequence converges almost surely…

Panagiotou and Stufler (arXiv:1502.07180v2) recently proved one important fact on their way to establish the scaling limits of random P\'{o}lya trees: a uniform random P\'{o}lya tree of size $n$ consists of a conditioned critical…

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths…

We show that a uniform quadrangulation, its largest 2-connected block, and its largest simple block jointly converge to the same Brownian map in distribution for the Gromov-Hausdorff-Prokhorov topology. We start by deriving a local limit…

For each $n\in\mathbb{N}$, let $\mathbf{Q}_n$ be a uniform rooted measured quadrangulation of size $n$ conditioned to have $r(n)$ vertices in its root block. We prove that for a suitable function $r(n)$, after rescaling graph distance by…

We find precise asymptotic estimates for the number of planar maps and graphs with a condition on the minimum degree, and properties of random graphs from these classes. In particular we show that the size of the largest tree attached to…

We generalize recent results of Haas and Miermont to obtain scaling limits of Markov branching trees whose size is specified by the number of nodes whose out-degree lies in a given set. We then show that this implies that the scaling limit…

Albertson and Berman conjectured that every planar graph has an induced forest on half of its vertices. The best known lower bound, due to Borodin, is that every planar graph has an induced forest on two fifths of its vertices. In a related…

A graph is beyond-planar if it can be drawn in the plane with a specific restriction on crossings. Several types of beyond-planar graphs have been investigated, such as k-planar if every edge is crossed at most k times and RAC if edges can…

We introduce a model of tree-rooted planar maps weighted by their number of $2$-connected blocks. We study its enumerative properties and prove that it undergoes a phase transition. We give the distribution of the size of the largest…

A recent preprint (arXiv:1402.2632) introduced a growth procedure for planar maps, whose almost sure limit is "the uniform infinite 3-connected planar map". A classical construction of Brooks, Smith, Stone and Tutte (1940) associates a…

Not every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of…