## Abstract A new proof of Menger's theorem is presented.
A New Proof of Whitman′s Embedding Theorem
✍ Scribed by J. Tuma
- Publisher
- Elsevier Science
- Year
- 1995
- Tongue
- English
- Weight
- 165 KB
- Volume
- 173
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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.
## Abstract A proof of Menger's theorem is presented.