✦ LIBER ✦

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

✍ Scribed by P. Jean-Jacques Herings

Publisher: Springer
Year: 1997
Tongue: English
Weight: 441 KB
Volume: 10
Category: Article
ISSN: 0938-2259
DOI: 10.1007/s001990050161

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

✍ Hidetoshi Komiya 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 182 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 simple proof of Pach's extremal theore

A simple proof of Pach's extremal theorem for convex polygons

✍ Godfried T Toussaint 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 83 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 the Künneth theorem fo

A simple proof of the Künneth theorem for Alexander Cohomology

✍ Kermit Sigmon 📂 Article 📅 1975 🏛 Springer 🌐 English ⚖ 338 KB