Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,718,776 papers from all fields of science
Search
Sign In
Create Free Account
Menger's theorem
Known as:
Menger's n-arc theorem
, Menger
, Erdős–Menger conjecture
Expand
In the mathematical discipline of graph theory and related areas, Menger's theorem is a characterization of the connectivity in finite undirected…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
20 relations
Barrier resilience
Connectivity (graph theory)
Directed graph
End (graph theory)
Expand
Broader (1)
Network theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Max-flow min-cut theorems on dispersion and entropy measures for communication networks
Søren Riis
,
M. Gadouleau
Inf. Comput.
2019
Corpus ID: 128254794
2018
2018
Conditional (edge-)fault-tolerant strong Menger (edge) connectivity of folded hypercubes
Qi Cheng
,
Pingshan Li
,
Min Xu
Theor. Comput. Sci.
2018
Corpus ID: 13802558
2005
2005
Renormalization of the 2-Point Function of the Hubbard Model at Half-Filling
Stephane Afchain
,
J. Magnen
,
V. Rivasseau
2005
Corpus ID: 17403164
Abstract.We prove that the Hubbard model at finite temperature T and half-filling is analytic in its coupling constant λ for…
Expand
2001
2001
Menger's Theorem
T. Böhme
,
Frank Göring
,
J. Harant
J. Graph Theory
2001
Corpus ID: 9370918
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…
Expand
2001
2001
Menger's Theorem
T. Böhme
,
Frank Göring
,
J. Harant
2001
Corpus ID: 121779860
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…
Expand
1995
1995
Short length versions of Menger's theorem
Z. Galil
,
Xiangdong Yu
STOC '95
1995
Corpus ID: 1731497
Consider a simple n-vertex undirected graph and assume there are ~ edge-disjoint paths between two vertices u and V. We prove the…
Expand
1991
1991
A mixed version of Menger's theorem
Y. Egawa
,
A. Kaneko
,
M. Matsumoto
Comb.
1991
Corpus ID: 206793996
An(a, b)-n-fan means a union ofn internally disjoint paths. Menger's theorem states that a graphG has an(a, b)-n-fan if and only…
Expand
1984
1984
A simple proof of Menger's theorem
W. McCuaig
J. Graph Theory
1984
Corpus ID: 41323557
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…
Expand
1979
1979
Graphs with prescribed connectivity and line graph connectivity
D. Bauer
,
R. Tindell
J. Graph Theory
1979
Corpus ID: 30075165
Chartrand and Stewart have shown that the line graph of an n-connected graph is itself n-connected. This paper shows that for…
Expand
Highly Cited
1972
Highly Cited
1972
Introduction to Graph Theory
Robin J. Wilson
1972
Corpus ID: 122268427
Introduction * Definitions and examples* Paths and cycles* Trees* Planarity* Colouring graphs* Matching, marriage and Menger's…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE