A minimax theorem for infinite graphs with ideal points

DOI10.1016/0012-365X(92)90039-IMaRDI QIDQ1196749zbMATH OpenOpenAlexFDO

Authors Norbert Polat

Publication date 16 January 1993

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(92)90039-i

zbMATH Keywords

\(A\)-path\(A\)-separatorendsinfinite graphsminimax theorem

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph theory (05C99)

Review text

This paper is devoted to problems related to Menger's Theorem and concerning infinite graphs. The main concepts are \(A\)-path and \(A\)- separator. If \(A\) is an independent set in a graph \(G\), then an \(A\)-path is a path in \(G\) whose terminal vertices are in \(A\) and whose inner vertices are outside \(A\). A pair \((S,T)\) is called an \(A\)-separator, if \(S\) is a subset of the vertex set of \(G\), \(T\) is a subset of the edge set of \(G\), \(S\) is disjoint with \(A\), end vertices of edges of \(T\) are neither in \(A\) nor in \(S\), and every \(A\)-path in \(G\) contains either a vertex from \(S\) or an edge from \(T\). These concepts are generalized to the concept of \({\mathcal A}\)-path and the concept of \({\mathcal A}\)-separator, for a set \({\mathcal A}\) of pairwise disjoint subsets of the set of ends of an infinite graph \(G\). Some theorems concerning the interconnections between \(A\)-separators (or \({\mathcal A}\)-separators) and systems of disjoint \(A\)-paths (or \({\mathcal A}\)-paths) are proved.

Recommendations

• Minimax theorems for infinite graphs with the ends as ideal points
• scientific article; zbMATH DE number 970819
• A Mengerian theorem for infinite graphs with ideal points
• Menger's theorem for infinite graphs with ends
• Menger's theorem for infinite graphs

Cites work

• A Mengerian theorem for infinite graphs with ideal points
• A note on Menger's theorem for infinite locally finite graphs
• A selection lemma
• Aspects topologiques de la séparation dans les graphes infinis. I. II
• Développements terminaux des graphes infinis I. Arbres maximaux coterminaux
• Improper vertices of a graph
• Über die Enden diskreter Räume und Gruppen
• Über die Maximalzahl kreuzungsfreier H-Wege
• Über unendliche Wege in Graphen

Cited in

(8)

• Menger's theorem for infinite graphs
• Sur une extension du théorème de Menger aux graphes infinis. (On an extension of Menger's theorem to infinite graphs)
• A Mengerian theorem for infinite graphs with ideal points
• On the existence of minimal end-separators
• A compactness theorem for complete separators
• Finite separating sets in locally finite graphs
• Minimax theorems for infinite graphs with the ends as ideal points
• An accessibility theorem for infinite graph minors

This page was built for publication: A minimax theorem for infinite graphs with ideal points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1196749)