English
Related papers

Related papers: Ends and Tangles

200 papers

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…

Combinatorics · Mathematics 2015-03-18 Maya Stein

This paper is the last part of a comprehensive survey of a newly emerging field: a topological approach to the study of locally finite graphs that crucially incorporates their ends. Topological arcs and circles, which may pass through ends,…

Algebraic Topology · Mathematics 2010-05-12 Reinhard Diestel , Philipp Sprüssel

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…

Geometric Topology · Mathematics 2021-03-02 Craig R. Guilbault

The notion of ends in an infinite graph $G$ might be modified if we consider them as equivalence classes of infinitely edge-connected rays, rather than equivalence classes of infinitely (vertex-)connected ones. This alternative definition…

Combinatorics · Mathematics 2026-04-16 Leandro Fiorini Aurichi , Paulo Magalhães Júnior , Lucas Real

We show that the topological space of any infinite graph and its ends is normal. In particular, end spaces themselves are normal.

Combinatorics · Mathematics 2009-11-23 Philipp Sprüssel

Two of the natural topologies for infinite graphs with edge-ends are Etop and Itop. In this paper, we study and characterize them. We show that Itop can be constructed by inverse limits of inverse systems of graphs with finitely many…

General Topology · Mathematics 2016-12-20 Babak Miraftab

A coarse compactification of a proper metric space $X$ is any compactification of $X$ that is dominated by its Higson compactification. In this paper we describe the maximal coarse compactification of $X$ whose corona is of dimension $0$.…

Metric Geometry · Mathematics 2021-02-10 Yuankui Ma , Jerzy Dydak

We prove that the edge-end space of an infinite graph is metrizable if and only if it is first-countable. This strengthens a recent result by Aurichi, Magalhaes Jr.\ and Real (2024). Our central graph-theoretic tool is the use of tree-cut…

Combinatorics · Mathematics 2025-07-23 Max Pitz

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

Combinatorics · Mathematics 2018-10-10 Jacob W. Cooper , Daniel Kral , Taisa L. Martins

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…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…

Combinatorics · Mathematics 2021-01-19 Jan Kurkofka , Ruben Melcher

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Group Theory · Mathematics 2009-05-08 M. J. Dunwoody

Carmesin has extended Robertson and Seymour's tree-of-tangles theorem to the infinite tangles of locally finite infinite graphs. We extend it further to the infinite tangles of all infinite graphs. Our result has a number of applications…

Combinatorics · Mathematics 2021-01-20 Ann-Kathrin Elm , Jan Kurkofka

We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characterize the graphs for which the two coincide. We construct a…

Combinatorics · Mathematics 2009-10-30 Reinhard Diestel , Philipp Sprüssel

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Combinatorics · Mathematics 2010-03-19 Matthias Hamann

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…

Combinatorics · Mathematics 2023-05-17 Marcel Koloschin , Thilo Krill , Max Pitz

G\'abor Elek introduced the notion of a hyperfinite graph family: a collection of graphs is hypefinite if for every $\epsilon>0$ there is some finite $k$ such that each graph $G$ in the collection can be broken into connected components of…

Probability · Mathematics 2007-11-27 Oded Schramm

Ends and end cohomology are powerful invariants for the study of noncompact spaces. We present a self-contained exposition of the topological theory of ends and prove novel extensions including the existence of an exhaustion of a proper…

Algebraic Topology · Mathematics 2025-04-17 William G. Bass , Jack S. Calcut

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…

Combinatorics · Mathematics 2018-10-17 Roman Glebov , Tereza Klimosova , Daniel Kral

A circle of an infinite locally finite graph $G$ is the imagine of a homeomorphic mapping of the unit circle $S^1$ in $|G|$, the Freudenthal compactification of $G$. A circle of $G$ is Hamiltonian if it meets every vertex (and then every…

Combinatorics · Mathematics 2019-04-29 Binlong Li