Menger's theorem

Known as: Menger's n-arc theorem, Menger, Erdős–Menger conjecture

In the mathematical discipline of graph theory and related areas, Menger's theorem is a characterization of the connectivity in finite undirected…

Papers overview

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

2018

Menger conjectured that subsets of $\mathbb R$ with the Menger property must be $\sigma$-compact. While this is false when there…

2011

Most ISPs rely on their upstream providers in achieving global reachability, thus they tend to make backup upstream links for the…

2006

The one-way measurement model [1, 2, 3] is a framework for universal quantum computation, in which algorithms are partially…

1995

A graphG is called a block—cactus graph if each block ofG is complete or a cycle. In this paper, we shall show that a block…

1992

Let G be a k-connected graph of order n. For an independent set c, let d(S) be the number of vertices adjacent to at least one…

1978

A new proof of Menger's theorem is presented. The purpose of this note is to give a new proof of a classical theorem of Menger [8…

1977

Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite…

1974

1971

Let G be a finite directed graph with X, Y disjoint subsets of the nodes of G. Menger's theorem [6] asserts that the maximum…

1969

Here is a more detailed version of the proof of Menger’s theorem on page 50 of Diestel’s book. First let’s clarify some details…