Graph-like continua, augmenting arcs, and Menger's theorem
type: Item
instance of: scholarly article
title: Graph-like continua, augmenting arcs, and Menger's theorem
zbMATH Open document ID: 1175.05045
author: Carsten Thomassen
author: Antoine Vella
published in: Combinatorica
publication date: 2009-07-20T00:00:00Z
review text: Menger's theorem has been a cornerstone of graph theory, since 1930. The authors show that a variant of the augmenting path method used for finite graphs proves Menger's theorem for wide classes of topological graphs. For example, it is easily proved for locally compact, locally connected, metric spaces, as already known by results of \textit{G. I. Whyburn} [Trans. Am. Math. Soc. 63, 452--456 (1948; Zbl 0031.41802)]; moreover, in virtue of \textit{G. Nöbeling} [Fundam. Math. 18, 23--38 (1932; Zbl 0004.16204)], the method applies to the so called graph-like continua. The method lends itself particularly well to another class of spaces, namely the locally arcwise connected, hereditarily locally connected, metric spaces. Finally, it applies to every space where every point can be separated from every closed set non containing it by a finite set, in particular to every subspace of the Freudenthal compactification of a locally finite, connected graph.
reviewed by: Maria Rita Casali
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 57M15
Mathematics Subject Classification ID: 54D30
zbMATH DE Number: 5580969
zbMATH Keywords: Menger's theorem
zbMATH Keywords: augmenting path method
zbMATH Keywords: locally finite graph
zbMATH Keywords: Freudenthal compactification
zbMATH Keywords: graph-like continua
Wikidata QID: Q56926634
MaRDI profile type: MaRDI publication profile
full work available at URL: s00493-008-2342-9
OpenAlex ID: W2144614595
cites work: Menger's theorem for infinite graphs
cites work: Q5604326
cites work: Menger's theorem
cites work: The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
cites work: Menger's theorem for infinite graphs with ends
cites work: The countable Erdős-Menger conjecture with ends
cites work: Q5315023
cites work: The Erdős-Menger conjecture for source/sink sets with disjoint closures
cites work: End spaces and spanning trees
cites work: Graph-theoretical versus topological ends of graphs.
cites work: On infinite cycles. I, II
cites work: Topological paths, cycles and spanning trees in infinite graphs
cites work: Extensions of Menger's Theorem†
cites work: Q4150804
cites work: Connected but not path-connected subspaces of infinite graphs
cites work: Menger's Theorem for topological spaces
cites work: A note on Menger's theorem for infinite locally finite graphs
cites work: An \(n\)-arc theorem for Peano spaces
cites work: On the dimension of almost 𝑛-dimensional spaces
cites work: A simple proof of Menger's theorem
cites work: On the origin of then-arc theorem
cites work: Graphs on surfaces
cites work: Q4004123
cites work: Aspects topologiques de la séparation dans les graphes infinis. I. II
cites work: A Mengerian theorem for infinite graphs with ideal points
cites work: Classification of locally 2-connected compact metric spaces
cites work: Some n-arc theorems
cites work: Compactification of Hereditarily Locally Connected Spaces
cites work: Cycle spaces in topological spaces
cites work: The Cyclic and Higher Connectivity of Locally Connected Spaces
cites work: On n-Arc Connectedness
cites work: Improper vertices of a graph
cites work: Independent arcs of a continuous curve
DBLP publication ID: journals/combinatorica/ThomassenV08
DOI: 10.1007/S00493-008-2342-9
description: scientific article; zbMATH DE number 5580969