Graph-like continua, augmenting arcs, and Menger's theorem
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.
- A Mengerian theorem for infinite graphs with ideal points
- A note on Menger's theorem for infinite locally finite graphs
- A simple proof of Menger's theorem
- An \(n\)-arc theorem for Peano spaces
- Aspects topologiques de la séparation dans les graphes infinis. I. II
- Classification of locally 2-connected compact metric spaces
- Compactification of Hereditarily Locally Connected Spaces
- Connected but not path-connected subspaces of infinite graphs
- Cycle spaces in topological spaces
- End spaces and spanning trees
- Extensions of Menger's Theorem†
- Graph-theoretical versus topological ends of graphs.
- Graphs on surfaces
- scientific article; zbMATH DE number 53928 (Why is no real title available?)
- scientific article; zbMATH DE number 3581219 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- scientific article; zbMATH DE number 3325399 (Why is no real title available?)
- Improper vertices of a graph
- Independent arcs of a continuous curve
- Menger's theorem
- Menger's theorem for infinite graphs
- Menger's theorem for infinite graphs with ends
- Menger's Theorem for topological spaces
- On infinite cycles. I, II
- On n-Arc Connectedness
- On the dimension of almost 𝑛-dimensional spaces
- On the origin of then-arc theorem
- Some n-arc theorems
- The countable Erdős-Menger conjecture with ends
- The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits
- The Cyclic and Higher Connectivity of Locally Connected Spaces
- The Erdős-Menger conjecture for source/sink sets with disjoint closures
- Topological paths, cycles and spanning trees in infinite graphs
- Peripheral circuits in infinite binary matroids
- Minimum topological group topologies
- \(n\)-arc and \(n\)-circle connected graph-like spaces
- On graph-like continua of finite length
- Graph-like spaces: an introduction
- Weakly Whitney preserving maps
- Representations of infinite tree sets
- Topological cycle matroids of infinite graphs
- Cycle spaces in topological spaces
- Brownian motion on graph-like spaces
- On planar Cayley graphs and Kleinian groups
- Embedding a graph-like continuum in a surface
- Embedding a graph-like continuum in some surface
- New bounds for edge-cover by random walk
- Universal end-compactifications of locally finite graphs
- Eulerian Spaces
- The fundamental group of a locally finite graph with ends
- The homology of a locally finite graph with ends
- Eulerian edge sets in locally finite graphs
- On regularity of maximal distance minimizers in \(\mathbb{R}^n\)
- Infinite graphic matroids
This page was built for publication: Graph-like continua, augmenting arcs, and Menger's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390152)
