Related papers: Asymptotic dimension and the disk graph I
We consider when automorphisms of a graph can be induced by homeomorphisms of embeddings of the graph in a $3$-manifold. In particular, we prove that every automorphism of a graph is induced by a homeomorphism of some embedding of the graph…
We show that a strongly irreducible and boundary-strongly irreducible surface can be isotoped to be almost normal in a triangulated 3-manifold.
We establish a correspondence between trisections of smooth, compact, oriented $4$--manifolds with connected boundary and diagrams describing these trisected $4$--manifolds. Such a diagram comes in the form of a compact, oriented surface…
We give a survey of geometric approaches to the topological 4-dimensional surgery and 5-dimensional s-cobordism conjectures, with a focus on the study of surfaces in 4-manifolds. The geometric lemma underlying these conjectures is a…
A unit disk graph is the intersection graph of disks of equal radii in the plane. The class of unit disk graphs is hereditary, and therefore admits a characterization in terms of minimal forbidden induced subgraphs. In spite of quite active…
A nonuniform Neumann boundary-value problem is considered for the Poisson equation in a thin $3D$ aneurysm-type domain that consists of thin curvilinear cylinders that are joined through an aneurysm of diameter $\mathcal{O}(\varepsilon).$ A…
Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine…
The asymptotic dimension is an invariant of metric spaces introduced by Gromov in the context of geometric group theory. In this paper, we study the asymptotic dimension of metric spaces generated by graphs and their shortest path metric…
We consider the problem of classifying those graphs that arise as an undirected square of an oriented graph by generalising the notion of quasi-transitive directed graphs to mixed graphs. We fully classify those graphs of maximum degree…
We classify $n$-dimensional geometric graph manifolds with nonnegative scalar curvature, and first show that if $n>3$, the universal cover splits off a codimension 3 Euclidean factor. We then proceed with the classification of the…
This paper deals with the problem of detecting non-isotropic high-dimensional geometric structure in random graphs. Namely, we study a model of a random geometric graph in which vertices correspond to points generated randomly and…
Suppose n>2, let M,M' be n-dimensional connected complete finite-volume hyperbolic manifolds with non-empty geodesic boundary, and suppose that the fundamental group of M is quasi-isometric to the fundamental group of M' (with respect to…
We construct sequences of `expander manifolds' and we use them to show that there is a complete connected 2-dimensional Riemannian manifold with discontinuous isoperimetric profile, answering a question of Nardulli and Pansu. Using expander…
We give an upper bound for the number of compact essential orientable non-isotopic surfaces, with Euler characteristic at least some constant $\chi$, properly embedded in a finite-volume hyperbolic 3-manifold $M$, closed or cusped. This…
In this paper, we introduce a notion of geometric surgery for flag structures, which are geometric structures locally modelled on the three-dimensional flag space under the action of ${\mathrm{PGL}}_3(\mathbb{R})$. Using such surgeries we…
We enumerate the connected graphs that contain a linear number of edges with respect to the number of vertices. So far, only the first term of the asymptotics was known. Using analytic combinatorics, i.e. generating function manipulations,…
First the title could be also understood as ``3-manifolds related by non-zero degree maps" or "Degrees of maps between 3-manifolds" for some aspects in this survey talk. The topology of surfaces was completely understood at the end of 19th…
We show that if C is a simple closed curve bounding an embedded disk in a closed 3-manifold M, then there exists a disk D in M with boundary C such that D minimizes the area among the embedded disks with boundary C. Moreover, D is smooth,…
We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…
Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…