Related papers: Topological remarks on end and edge-end spaces

We answer two questions about the topology of end spaces of infinite type surfaces and the action of the mapping class group that have appeared in the literature. First, we give examples of infinite type surfaces with end spaces that are…

We present a systematic investigation into how tree-decompositions of finite adhesion capture topological properties of the space formed by a graph together with its ends. As main results, we characterise when the ends of a graph can be…

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$…

The edge space $\mathcal{E}(G)$ of a graph $G$ is the vector space $\mathbb{F}_2^{E(G)}$ with members naturally identified with subgraphs of $G$, and the $H$-space is the subspace $\mathcal{C}_H(G)$ of $ \mathcal{E}(G)$ spanned by copies of…

For a finite point set $E\subset \mathbb{R}^d$ and a connected graph $G$ on $k+1$ vertices, we define a $G$-framework to be a collection of $k + 1$ points in E such that the distance between a pair of points is specified if the…

We consider undirected simple finite graphs. The sets of vertices and edges of a graph $G$ are denoted by $V(G)$ and $E(G)$, respectively. For a graph $G$, we denote by $\delta(G)$ and $\eta(G)$ the least degree of a vertex of $G$ and the…

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

We define a notion of (one-sided) shift spaces over infinite alphabets. Unlike many previous approaches to shift spaces over countable alphabets, our shift spaces are compact Hausdorff spaces. We examine shift morphisms between these shift…

Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each element of $\mathcal{E}$ and an edge for each…

In a series of three papers we develop an end space theory for digraphs. Here in the third paper we introduce a concept of depth-first search trees in infinite digraphs, which we call normal spanning arborescences. We show that normal…

The local complement G*i of a simple graph G at one of its vertices i is obtained by complementing the subgraph induced by the neighborhood of i and leaving the rest of the graph unchanged. If e={i,j} is an edge of G then G*e=((G*i)*j)*i is…

We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…

We show that an arbitrary infinite graph can be compactified by its ${\aleph_0}$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a…

This is the final one in the series of papers where we introduce and study the $C^*$-algebras associated with topological graphs. In this paper, we get a sufficient condition on topological graphs so that the associated $C^*$-algebras are…

We show that finite-type surfaces are characterized by a topological analog of the Hopf property. Namely, an oriented surface $\Sigma$ is of finite-type if and only if every proper map $f\colon\Sigma\to \Sigma$ of degree one is homotopic to…

We study the notions of continuous orbit equivalence and eventual one-sided conjugacy of finitely-aligned higher-rank graphs and two-sided conjugacy of row-finite higher-rank graphs with finitely many vertices and no sinks or sources. We…

To each finite frame $\varphi$ in an inner product space $\mathcal{H}$ we associate a simple graph $G(\varphi)$, called {\it frame graph}, with the vectors of the frame as vertices and there is an edge between vertices $f$ and $g$ provided…

We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…