In the mathematical discipline of graph theory and related areas, Menger's theorem is a characterization of the connectivity in finite undirectedâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2011

2011

- Sunil Mathew, M. S. Sunitha
- Appl. Math. Lett.
- 2011

This paper generalizes one of the celebrated results in Graph Theory due to Karl. A. Menger (1927), which plays a crucial roleâ€¦Â (More)

Is this relevant?

2008

2008

- Carsten Thomassen, Antoine Vella
- Combinatorica
- 2008

We show that an adaptation of the augmenting path method for graphs proves Mengerâ€™s Theorem for wide classes of topologicalâ€¦Â (More)

Is this relevant?

2007

2007

- Ron Aharoni, Karl Menger
- 2007

We prove that Mengerâ€™s theorem is valid for infinite graphs, in the following strong version: let A and B be two sets of verticesâ€¦Â (More)

Is this relevant?

2005

2005

- Henning Bruhn, Reinhard Diestel, Maya Jakobine Stein
- Journal of Graph Theory
- 2005

A well-known conjecture of ErdÅ‘s states that, given an infinite graph G and sets A,B âŠ† V (G), there exists a family of disjoint Aâ€¦Â (More)

Is this relevant?

2001

2001

- Thomas BÃ¶hme, Frank GÃ¶ring, Jochen Harant
- Journal of Graph Theory
- 2001

Menger's Theorem for digraphs states that for any two vertex sets A and B of a digraph D such that A cannot be separated from Bâ€¦Â (More)

Is this relevant?

1995

1995

- Yubao Guo, Lutz Volkmann
- Graphs and Combinatorics
- 1995

A graph G is called a block-cactus graph if each block of G is complete or a cycle. In this paper, we shall show that a blockâ€¦Â (More)

Is this relevant?

1995

1995

- Zvi Galil, Xiangdong Yu
- STOC
- 1995

Consider a simple n-vertex undirected graph and assume there are ~ edge-disjoint paths between two vertices u and V. We prove theâ€¦Â (More)

Is this relevant?

1994

1994

- Ron Aharoni, Reinhard Diestel
- Combinatorics, Probability & Computing
- 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â€¦Â (More)

Is this relevant?

1987

1987

- Ron Aharoni
- J. Comb. Theory, Ser. B
- 1987

For a finite graph G= (Iâ€™, E) Mengerâ€™s Theorem [6] states the following: if A, B c V then the minimal size of an A -B separatingâ€¦Â (More)

Is this relevant?

1984

1984

- William McCuaig
- Journal of Graph Theory
- 1984

A proof of Mengerâ€™s theorem is presented. We use the notation and terminology of Bondy and Murty [ll. Let D be a directed graphâ€¦Â (More)

Is this relevant?