Related papers: Topological remarks on end and edge-end spaces
For bi-Lipschitz homeomorphisms of a compact manifold it is known that topological entropy is always finite. For compact manifolds of dimension two or greater, we show that in the closure of the space of bi-Lipschitz homeomorphisms, with…
We give a sufficient condition on totally disconnected topological graphs such that their associated topological graph algebras are purely infinite.
A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…
Let G be a compact Lie group. By work of Chataur and Menichi, the homology of the space of free loops in the classifying space of G is known to be the value on the circle in a homological conformal field theory. This means in particular…
A graph $G$ is $\textit{universal}$ for a (finite) family $\mathcal{H}$ of graphs if every $H \in \mathcal{H}$ is a subgraph of $G$. For a given family $\mathcal{H}$, the goal is to determine the smallest number of edges an…
The main aim of the paper is to study in greater detail absolutely homogeneous structures (that is, objects with the property that each partial isomorphism extends to a global automorphism), with special emphasis on metric spaces and…
Given a finitely generated $G$ and a subgraph $H \leq G$, the relative number of ends $e(G,H)$ is the number of ends of a Schreier graph $\mathrm{Sch}(G,H)$ and the number of coends $\tilde{e}(G,H)$ is the maximal number of $H$-infinite…
We extend to infinite graphs the matroidal characterization of finite graph duality, that two graphs are dual iff they have complementary spanning trees in some common edge set. The naive infinite analogue of this fails. The key in an…
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…
We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…
We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…
Any simple group-grading of a finite dimensional complex algebra induces a natural family of digraphs. We prove that $|E\circ E^{\text{op}}\cup E^{\text{op}}\circ E|\geq |E|$ for any digraph $\Gamma =(V,E)$ without parallel edges, and…
An end of a graph $G$ is an equivalence class of rays, where two rays are equivalent if there are infinitely many vertex-disjoint paths between them in $G$. The degree of an end is the maximum cardinality of a collection of pairwise…
Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…
A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…
We show that every graph admits a canonical tree-like decomposition into its $k$-edge-connected pieces for all $k\in\mathbb{N}\cup\{\infty\}$ simultaneously.
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
We define two classes of topological infinite degree covering maps modeled on two families of transcendental holomorphic maps. The first, which we call exponential maps of type $(p,q)$, are branched covers and is modeled on transcendental…
Bounds on the minimum degree and on the number of vertices at- taining it have been much studied for finite edge-/vertex-minimally k- connected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show…
In this article we give an explicit classification for the countably infinite graphs $\mathcal{G}$ which are, for some $k$, $\geq$$ k$-homogeneous. It turns out that a $\geq$$k-$homogeneous graph $\mathcal{M}$ is non-homogeneous if and only…