Menger's theorem
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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
- 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?