✦ LIBER ✦

On König's theorem

✍ Scribed by L. A. Suprunenko

Publisher: Springer US
Year: 1976
Tongue: English
Weight: 468 KB
Volume: 11
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070444

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on König's minimax theorem

✍ L. L. Stachó 📂 Article 📅 1994 🏛 Akadmiai Kiad 🌐 English ⚖ 368 KB

On König's Theorem for infinite bipartit

On König's Theorem for infinite bipartite graphs

✍ Mordechai Lewin 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 129 KB

Variation on a theorem of König

✍ D. de Werra 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 334 KB

A min-max property of bipartite graphs is stated; it is a variation on the theorem of Kiinig 'maximum x%zhing= minimum covering'; one shows that a c&&i inequaliw holds for any graph and the equality for bipartite graphs is derived from a simple network flow model. -. ## Various extensions of the t

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

Strong transfinite version of König's du

Strong transfinite version of König's duality theorem

✍ R. A. Brualdi 📂 Article 📅 1971 🏛 Springer Vienna 🌐 English ⚖ 205 KB

On uniform weak König's lemma

✍ Ulrich Kohlenbach 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 121 KB

The so-called weak K onig's lemma WKL asserts the existence of an inÿnite path b in any inÿnite binary tree (given by a representing function f). Based on this principle one can formulate subsystems of higher-order arithmetic which allow to carry out very substantial parts of classical mathematics b