✦ LIBER ✦

More proofs of menger's theorem

✍ Scribed by C. St. J. A. Nash-Williams; W. T. Tutte

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 231 KB
Volume: 1
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190010107

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Four ways of proving Menger's Theorem by induction are described. Two of them involve showing that the theorem holds for a finite undirected graph G if it holds for the graphs obtained from G by deleting and contracting the same edge. The other two prove the directed version of Menger's Theorem to be true for a finite digraph D if it is true for a digraph obtained by deleting an edge from D.

📜 SIMILAR VOLUMES

A new proof of menger's theorem

✍ Peter V. O'Neil 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 1 views

## Abstract A new proof of Menger's theorem is presented.

A simple proof of Menger's theorem

✍ William McCuaig 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

## Abstract A proof of Menger's theorem is presented.

Menger's Theorem

✍ T. Böhme; F. Göring; J. Harant 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB

## Abstract 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__ by a set of at most __t__ vertices, there are __t + 1__ disjoint __A__–__B__‐paths in __D__. Here a short and elementary proof of a more ge

Menger's theorem for infinite graphs wit

Menger's theorem for infinite graphs with ends

✍ Henning Bruhn; Reinhard Diestel; Maya Stein 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 127 KB

## 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 𝓅 together with an __A__ − __B__ separator __X__ consisting of a choice of one vertex from each path in 𝓅. There is a natural

Another Proof of Gluck's Theorem

✍ Hiroshi Matsuyama 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 56 KB

In this article, G is a permutation group on a finite set . We write permutations on the right, so that αg is the image of α ∈ by the action of g ∈ G. A subset S of is said to be G-regular if the stabilizer g ∈ G Sg = S is the identity. Our purpose is to give a direct short proof of the following t

A Proof of Shirshov's Theorem

✍ Giuseppe Pirillo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 188 KB

Sane copiosam tu et uberem messem ex hoc agro collegisti, nos pauculas spicas contemptas tibi potius quam non visas. Triumphus igutur hic omnis tuus est: mihi abunde satis si armillis aut hasta donatus, sequar hunc candidae famae tuae currum. wJustus Lipsius In this paper we prove that, except fo