Can I read Menger's Theorem for Infinite Graphs with Ends on EtoBox?

Menger's Theorem for Infinite Graphs with Ends by Henning Bruhn; Reinhard Diestel; Maya Stein is a Computer Science article available to read on EtoBox.

What is Menger's Theorem for Infinite Graphs with Ends about?

## Abstract A well‐known conjecture of Erdős states that given an infinite graph __G__ and sets __A__, ⊆ __V__(__G__), there exists a family of disjoint __A__ − __B__ paths p together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in p. There is a natural extension of this conjecture in which __A__, __B__, and __X__ may contain ends as well as vertices. We prove this extension by reducing it to the vertex version, which was recently proved by Aharoni and Berger. © 2005 Wiley Periodicals, Inc. J Graph Theory 50: 199–211, 2005

Who reads Menger's Theorem for Infinite Graphs with Ends?

Author

Henning Bruhn; Reinhard Diestel; Maya Stein

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0364-9024)

Published

2005

Language

EN

Field

Computer Science (Physical Sciences)