✦ LIBER ✦

A simple proof of K-K-M-S theorem

✍ Scribed by Hidetoshi Komiya

Publisher: Springer
Year: 1994
Tongue: English
Weight: 182 KB
Volume: 4
Category: Article
ISSN: 0938-2259
DOI: 10.1007/bf01215383

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An extremely simple proof of the K-K-M-S

An extremely simple proof of the K-K-M-S Theorem

✍ P. Jean-Jacques Herings 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 441 KB

A simple proof for König's minimax theor

A simple proof for König's minimax theorem

✍ G. Kassay 📂 Article 📅 1994 🏛 Akadmiai Kiad 🌐 English ⚖ 183 KB

A short proof of K�nig's matching theore

A short proof of K�nig's matching theorem

✍ Rizzi, Romeo 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 43 KB 👁 2 views

We give a short proof of the following basic fact in matching theory: in a bipartite graph the maximum size of a matching equals the minimum size of a node cover.

A short proof of kundu's k-factor theore

A short proof of kundu's k-factor theorem

✍ Yong-Chuan Chen 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 301 KB

We give a very short proof of the following theorem on k-factorable degree sequences due to Kundu [5]: Tbearem 1. Let (dl,d2,-.-,d,,) and.(d,-k,,d,-k,,...,d,-k,) be two graphical sequences satisfying k s ki s k + 1, 1 bi s n, for some k PO. Then there exists a' graph G =: (V, E) which contains a sub

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