✦ LIBER ✦

A simple proof of Menger's theorem

✍ Scribed by William McCuaig

Publisher: John Wiley and Sons
Year: 1984
Tongue: English
Weight: 111 KB
Volume: 8
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190080311

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

A proof of Menger's theorem is presented.

📜 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.

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

A simple proof for renewal theorems

✍ William Feller 📂 Article 📅 1961 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB 👁 1 views

A simple proof of lax-nirenberg theorems

✍ Rémi Vaillancourt 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 359 KB 👁 1 views

A Simple Proof of a Theorem of Milner

✍ Gyula O.H. Katona 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 174 KB

## Dedicated to the memory of Eric C. Milner A new short proof is given for the following theorem of Milner: An intersecting, inclusion-free family of subsets of an n-element set has at most ( n W(n+1)Â2X ) members.