Related papers: Gaskets of $O(2)$ loop-decorated random planar map…
We show that if $p=O(1/n)$, then the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ with high probability admits a canonical labeling computable in time $O(n\log n)$. Combined with the previous results on the canonization of random graphs, this…
The fractal structure and critical properties of the high-temperature graphs of the two-dimensional O($N)$ model close to criticality are investigated. Based on Monte Carlo simulations, De Gennes' results for polymer chains, corresponding…
A selfmap is Wecken when the minimal number of fixed points among all maps in its homotopy class is equal to the Nielsen number, a homotopy invariant lower bound on the number of fixed points. All selfmaps are Wecken for manifolds of…
We study the Fortuin--Kasteleyn model of planar maps with parameter $q\in (0,4)$ at and away from its self-dual point. This model is also bijectively equivalent to the fully packed (bicoloured) loop-$O(n)$ model on planar triangulations.…
We give both sufficient conditions and necessary conditions for the stochastic stability of non-uniformly expanding maps either with or without critical sets. We also show that the number of probability measures describing the statistical…
The critical behaviour of the O(n)-symmetric model with two n-vector fields is studied within the field-theoretical renormalization group approach in a D=4-2 epsilon expansion. Depending on the coupling constants the beta-functions, fixed…
We show that every $n$-vertex planar graph is 3-colourable with monochromatic components of size $O(n^{4/9})$. The best previous bound was $O(n^{1/2})$ due to Linial, Matou\v{s}ek, Sheffet and Tardos [Combin. Probab. Comput., 2008].
The main aim of this paper is to prove the existence of certain proper weakly $r$-harmonic ($ES-r$-harmonic) maps. We construct critical points which belong to a family of rotationally symmetric maps $\varphi_a : B^n \to \mathbb{S}^n$,…
The Nielsen number $N(f)$ is a lower bound for the minimal number of fixed points among maps homotopic to $f$. When these numbers are equal, the map is called Wecken. A recent paper by Brimley, Griisser, Miller, and the second author…
We study Koebe orderings of planar graphs: vertex orderings obtained by modelling the graph as the intersection graph of pairwise internally-disjoint discs in the plane, and ordering the vertices by non-increasing radii of the associated…
We study the random planar map obtained from a critical, finite variance, Galton-Watson plane tree by adding the horizontal connections between successive vertices at each level. This random graph is closely related to the well-known causal…
Criteria for piecewise linear circle homeomorphisms to be conjugate to a rigid rotation, $x\to x+\omega~({\rm mod}~1)$, with rational rotation number $\omega$ are given. The consequences of the existence of such maps in families of maps is…
Let $\gamma$ be a bounded convex curve on a plane. Then $\sharp (\gamma\cap (\Z/n)^2)=o(n^{2/3})$. It streghtens the classical result of Jarn\'\i k (an upper estimate $O(n^{2/3})$) and disproves a conjecture of Vershik on existence of the…
Our main result is an explicit operator-theoretic formula for the number of colored planar maps with a fixed set of stars each of which has a fixed set of half-edges with fixed coloration. The formula bounds the number of such colored…
This work is a follow-up of the article [Proc.\ London Math.\ Soc.\ 119(2):358--378, 2019], where the authors solved the problem of counting labelled 4-regular planar graphs. In this paper, we obtain a precise asymptotic estimate for the…
We use the nested loop approach to investigate loop models on random planar maps where the domains delimited by the loops are given two alternating colors, which can be assigned different local weights, hence allowing for an explicit Z_2…
In SoCG 2022, Conroy and T\'oth presented several constructions of sparse, low-hop spanners in geometric intersection graphs, including an $O(n\log n)$-size 3-hop spanner for $n$ disks (or fat convex objects) in the plane, and an $O(n\log^2…
We consider $k$-cop-win graphs in the binomial random graph $G(n,1/2).$ It is known that almost all cop-win graphs contain a universal vertex. We generalize this result and prove that for every $k \in N$, almost all $k$-cop-win graphs…
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…
We give a short proof that the largest component of the random graph $G(n, 1/n)$ is of size approximately $n^{2/3}$. The proof gives explicit bounds for the probability that the ratio is very large or very small.