Related papers: Surfaces have (asymptotic) dimension 2

Robertson and Seymour proved that for every finite tree $H$, there exists $k$ such that every finite graph $G$ with no $H$ minor has path-width at most $k$; and conversely, for every integer $k$, there is a finite tree $H$ such that every…

This article presents the precise asymptotical distribution of two types of critical transmission radii, defined in terms of $k-$connectivity and the minimum vertex degree, for a random geometry graph distributed over a unit-volume region…

Our previous paper applied a lopsided version of the Lov\'asz Local Lemma that allows negative dependency graphs to the space of random injections from an $m$-element set to an $n$-element set. Equivalently, the same story can be told about…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

We consider the class of simple graphs with large algebraic connectivity (the second-smallest eigenvalue of the Laplacian matrix). For this class of graphs we determine the asymptotic behavior of the number of Eulerian orientations. In…

It is proved that every graph embedded on a (non-spherical) surface with non-separating face-width at least $7$ contains a minor isomorphic to $K_6$. It is also shown that face-width four yields the same conclusion for graphs on the…

In this paper, we introduce the notion of 2-boundary planar graphs. A graph is 2-boundary planar if it has an embedding in the plane so that all vertices lie on the boundary of at most two faces and no edges are crossed. A proper coloring…

Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…

Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…

A diagonal base of a Sylow 2-subgroup $P_n(2)$ of symmetric group $S_{2^n}$ is a minimal generating set of this subgroup consisting of elements with only one non-zero coordinate in the polynomial representation. For different diagonal bases…

In 1930, Ramsey proved that every large graph contains either a large clique or a large edgeless graph as an induced subgraph. It is well known that every large connected graph contains a long path, a large clique, or a large star as an…

We introduce dynamic asymptotic dimension, a notion of dimension for actions of discrete groups on locally compact spaces, and more generally for locally compact \'etale groupoids. We study our notion for minimal actions of the integer…

We use geometric measure theory to introduce the notion of asymptotic cones associated with a singular subspace of a Riemannian manifold. This extends the classical notion of asymptotic directions usually defined on smooth submanifolds. We…

We say a graph has property $\mathcal{P}_{g,p}$ when it is an induced subgraph of the curve graph of a surface of genus $g$ with $p$ punctures. Two well-known graph invariants, the chromatic and clique numbers, can provide obstructions to…

We study the asymptotic behaviour of 1-parameter subgroups with respect to Hofer's metric when the underlying symplectic manifold is an open surface of infinite area. We prove that, depending on the topology of the level sets of the…

We consider for a small parameter $\varepsilon >0$ a parabolic convection-diffusion problem with P\'eclet number of order $\mathcal{O}(\varepsilon^{-1})$ in a three-dimensional graph-like junction consisting of thin curvilinear cylinders…

For a unimodular random graph $(G,\rho)$, we consider deformations of its intrinsic path metric by a (random) weighting of its vertices. This leads to the notion of the conformal growth exponent of $(G,\rho)$, which is the best asymptotic…

We prove that the asymptotic distribution of resonances has a multilevel internal structure for the following classes of Hamiltonians H: Schr\"odinger operators with point interactions in $\mathbb{R}^3$, quantum graphs, and 1-D photonic…

Nonlocal metric dimension ${\rm dim}_{\rm n\ell}(G)$ of a graph $G$ is introduced as the cardinality of a smallest nonlocal resolving set, that is, a set of vertices which resolves each pair of non-adjacent vertices of $G$. Graphs $G$ with…

We consider classes of diffeomorphisms of Euclidean space with partial asymptotic expansions at infinity; the remainder term lies in a weighted Sobolev space whose properties at infinity fit with the desired application. We show that two…