## Abstract A proof of Menger's theorem is presented.
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
## 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
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
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
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.