A Mengerian theorem for infinite graphs with ideal points (Q1113922)

If \(\tau\) and \(\tau\) ' are two ends of an infinite graph G then a \(\tau\) \(\tau\) '-path is defined as a double ray consisting of the union of two rays R and R', with \(R\in \tau\) and R'\(\in \tau '\), or as a ray or a path W such that, if W does not contain a ray belonging to \(\tau\) (resp. \(\tau\) '), then it has an endpoint wich cannot be separated from \(\tau\) (resp. \(\tau\) ') by a finite set of vertices. If A and B are two sets of ends of G, then an AB-path is any \(\tau\) \(\tau\) '-path with \((\tau,\tau ')\in A\times B.\) The main result of this paper states that, if A and B are such that every element of A (resp. B) can be separated from B (resp. A) by a finite set of vertices, then there are a set D of pairwise disjoint AB-paths, and a set S of vertices meeting every AB-path, such that D and S have the same cardinality.