A minimax theorem for infinite graphs with ideal points (Q1196749)

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.