Menger ' s theorem for a countable source

@inproceedings{Aharoni1994MengerS,
  title={Menger ' s theorem for a countable source},
  author={S. Aharoni and Reinhard DiestelDedicated},
  year={1994}
}
  • S. Aharoni, Reinhard DiestelDedicated
  • Published 1994
Paul Erd} os has conjectured that Menger's theorem extends to innnite graphs in the following way: whenever A; B are two sets of vertices in an innnite graph, there exist a set of disjoint A{B paths and an A{B separator in this graph so that the separator consists of a choice of precisely one vertex from each of the paths. We prove this conjecture for… CONTINUE READING