On the connectivity of infinite graphs and 2-complexes
type: Item
instance of: scholarly article
title: On the connectivity of infinite graphs and 2-complexes
zbMATH Open document ID: 0929.05050
DOI: 10.1016/S0012-365X(98)00033-8
author: M. J. Chávaz
author: Rafael Ayala
author: A. Márquez
author: Antonio Quintero
published in: Discrete Mathematics
publication date: 2000-01-11T00:00:00Z
review text: An analogue of the classical Menger-Whitney theorem equating the connectivity of a locally finite graph with its separation number is proved for locally finite 2-complexes, as conjectured by E. Y. Woon, who proved the finite case [Isr. J. Math. 52, 177-192 (1985; Zbl 0593.05046)]. Let \(n\) be a positive integer and let \(P\) denote a locally finite 2-complex with the following properties: (i) every vertex and edge are contained in a triangle, (ii) every two edges are joined by an alternating sequence of edges and triangles in which consecutive terms are incident, (iii) each triangle is incident with at most one edge that is incident with no other triangle, and (iv) all other edges are incident with at least \(n\) triangles. Let \(A\) and \(B\) each denote a set of vertices of \(P\) or a set of ends of \(P\). Theorem: There exist \(n\) internally disjoint paths (or rays or double rays) joining \(A\) and \(B\) in \(P\) if and only if \(P\) contains no set \(J\) of edges with \(| J| <n\) such that \(A\) and \(B\) are in different components of \(P-J\).
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 57M20
zbMATH DE Number: 1321835
zbMATH Keywords: connectivity
zbMATH Keywords: end
zbMATH Keywords: locally finite graph
zbMATH Keywords: 2-complex
zbMATH Keywords: cutset
reviewed by: Mark E. Watkins
MaRDI profile type: Publication
cites work: Decompositions of homology manifolds and their graphs
cites work: Connectedness and structure in graphs
cites work: Extensions of Menger's Theorem†
cites work: Über trennende Eckenmengen in Graphen und den Mengerschen Satz
cites work: Zur Theorie der n-fach zusammenhängenden Graphen
cites work: Die Maximalzahl fremder zweiseitig unendlicher Wege in Graphen
cites work: A note on Menger's theorem for infinite locally finite graphs
cites work: Q3995721
cites work: Characterizations of n-connected and n-line connected graphs
cites work: Q3484856
cites work: n-connectedness in pure 2-complexes
description: scientific article; zbMATH DE number 1321835