Related papers: Double dimers on planar hyperbolic graphs via circ…
We study asymptotics of the dimer model on large toric graphs. Let $\mathbb L$ be a weighted $\mathbb{Z}^2$-periodic planar graph, and let $\mathbb{Z}^2 E$ be a large-index sublattice of $\mathbb{Z}^2$. For $\mathbb L$ bipartite we show…
In 1991, Beardon and Stephenson [2] generalized the classical Schwarz-Pick lemma in hyperbolic geometry to the discrete Schwarz-Pick lemma for Andreev circle packings. This paper continues to investigate the discrete Schwarz-Pick lemma for…
We consider the dimer model in cylindrical domains $\Omega_\delta$ on square grids of mesh size $\delta$ with two Temperleyan boundary components of different colors. Assuming that the $\Omega_\delta$ approximate a cylindrical domain…
Rail-yard graphs are a general class of graphs introduced in \cite{bbccr} on which the random dimer coverings form Schur processes. We study asymptotic limits of random dimer coverings on rail yard graphs with free boundary conditions on…
We consider two extremal problems for set systems without long Berge cycles. First we give Dirac-type minimum degree conditions that force long Berge cycles. Next we give an upper bound for the number of hyperedges in a hypergraph with…
Hyperbolic tilings are natural infinite planar graphs where each vertex has degree $q$ and each face has $p$ edges for some $\frac1p+\frac1q<\frac12$. We study the structure of shortest paths in such graphs. We show that given a set of $n$…
The double-dimer model consists in superimposing two independent, identically distributed perfect matchings on a planar graph, which produces an ensemble of non-intersecting loops. Kenyon established conformal invariance in the small mesh…
We study the dimer and Ising models on a finite planar weighted graph with periodic-antiperiodic boundary conditions, i.e. a graph $\Gamma$ in the Klein bottle $K$. Let $\Gamma_{mn}$ denote the graph obtained by pasting $m$ rows and $n$…
A packing of a graph G with Hamilton cycles is a set of edge-disjoint Hamilton cycles in G. Such packings have been studied intensively and recent results imply that a largest packing of Hamilton cycles in G_n,p a.a.s. has size \lfloor…
We consider the dimer model on a bipartite graph embedded into a locally flat Riemann surface with conical singularities and satisfying certain geometric conditions in the spirit of the work of [Chelkak, Laslier and Russkikh, Proceedings of…
We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…
Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…
We study close-packed dimers on the quasiperiodic Ammann-Beenker (AB) graph, that was recently shown to have the unusual feature that hard-core dimer constraints are exactly reproduced at successive discrete length scales. This observation…
In this paper we investigate the height field of a dimer model/random domino tiling on the plane at a smooth-rough (i.e. gas-liquid) transition. We prove that the height field at this transition has two-point correlation functions which…
We prove absence of infinite clusters and contours in a class of critical constrained percolation models on the square lattice. The percolation configuration is assumed to satisfy certain hard local constraints, but only weak symmetry and…
The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Tur\'an- and Dirac-type results. While the Tur\'an-type result gives an exact threshold for the appearance of a Hamiltonian cycle in a hypergraph…
We consider dimer models on graphs which are bipartite, periodic and satisfy a geometric condition called {\em isoradiality}, defined in \cite{Kenyon3}. We show that the scaling limit of the height function of any such dimer model is…
We consider inhomogeneous percolation on a hierarchical configuration model with a heavy-tailed degree distribution. This graph is the configuration model where all the half-edges are colored either black or white, and edges are formed by…
The subject of the work are pairs of linearly coupled PT-symmetric dimers. Two different settings are introduced, namely, straight-coupled dimers, where each gain site is linearly coupled to one gain and one loss site, and cross-coupled…