Related papers: End spaces of graphs are normal

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

Graphons are analytic objects associated with convergent sequences of dense graphs. Finitely forcible graphons, i.e., those determined by finitely many subgraph densities, are of particular interest because of their relation to various…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…

Given a finite simplicial graph $\Gamma=(V,E)$ with a vertex-labelling $\varphi:V\rightarrow\left\{\text{non-trivial finitely generated groups}\right\}$, the graph product $G_\Gamma$ is the free product of the vertex groups $\varphi(v)$…

Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…

In this article, we construct a new simplicial complex for infinite-type surfaces, which we call the grand arc graph. We show that if the end space of a surface has at least three different self-similar equivalence classes of maximal ends,…

This survey/expository article covers a variety of topics related to the "topology at infinity" of noncompact manifolds and complexes. In manifold topology and geometric group theory, the most important noncompact spaces are often…

The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…

A graph $\G$ with a group $H$ of automorphisms acting semiregularly on the vertices with two orbits is called a {\em bi-Cayley graph} over $H$. When $H$ is a normal subgroup of $\Aut(\G)$, we say that $\G$ is {\em normal} with respect to…

In this paper, we develop the theory of Sobolev spaces on locally finite graphs, including completeness, reflexivity, separability, and Sobolev inequalities. Since there is no exact concept of dimension on graphs, classical methods that…

We analyze the number of ends of the mapping class group of a stable avenue surface. We prove that the mapping class group is one-ended whenever the stable avenue surface has at least one end of discrete type. Our method is to show that the…

We introduce the space of infinite volume ends of a locally compact second countable (lcsc) space that admits a Radon measure. In certain cases, this coincides with the classical space of ends. Consider a discrete subgroup $\Gamma$ of a…

We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…

In this paper, we study some topological characteristics of the n-normed spaces. We observe convergence sequences, closed sets, and bounded sets in the n-normed spaces using norms of quotient spaces that will be constructed. These norms…

While finite graphs have tree-decompositions that efficiently distinguish all their tangles, locally finite graphs with thick ends need not have such tree-decompositions. We show that every locally finite graph without thick ends admits…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…