## Abstract A new proof of Menger's theorem is presented.
A new proof of the Freyd's theorem
✍ Scribed by Jiři Vinárek
- Publisher
- Elsevier Science
- Year
- 1976
- Tongue
- English
- Weight
- 303 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0022-4049
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
A simple proof of Grfinbaum's theorem on the 3-colourability of planar graphs having at most three 3-cycles is given, which does not employ the colouring extension. In 1958, Gr6tzsch I-5] proved that every planar graph without cycles of length three is 3-colourable. In 1963, Griinbaum [6] extended
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