𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new proof of menger's theorem

✍ Scribed by Peter V. O'Neil


Publisher
John Wiley and Sons
Year
1978
Tongue
English
Weight
134 KB
Volume
2
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


Abstract

A new proof of Menger's theorem is presented.


πŸ“œ SIMILAR VOLUMES


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.

More proofs of menger's theorem
✍ C. St. J. A. Nash-Williams; W. T. Tutte πŸ“‚ Article πŸ“… 1977 πŸ› John Wiley and Sons 🌐 English βš– 231 KB

## 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

A New Proof of Monjardet's Median Theore
✍ D.E. Loeb πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 354 KB

New proofs are given for Monjardet's theorem that all strong simple games (i.e., ipsodual elements of the free distributive lattice) can be generated by the median operation. Tighter limits are placed on the number of iterations necessary. Comparison is drawn with the / function which also generates

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

A simple proof of Moser's theorem
✍ Zhu, Xuding πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 243 KB πŸ‘ 2 views

This article gives a simple proof of a result of Moser, which says that, for any rational number r between 2 and 3, there exists a planar graph G whose circular chromatic number is equal to r.