𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof of K�nig's matching theorem

✍ Scribed by Rizzi, Romeo


Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
43 KB
Volume
33
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis


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.


📜 SIMILAR VOLUMES


A short proof of a theorem on Hamiltonia
✍ Ainouche, A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB 👁 2 views

In this note, w e give a short proof of a stronger version of the following theorem: Let G be a 2-connected graph of order n such that for any independent set {u, u , w}, then G is hamiltonian. 0 1996 John

A simple proof of Moser's theorem
✍ Zhu, Xuding 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 243 KB 👁 1 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 short proof of Kuratowski's graph plan
✍ Makarychev, Yury 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB 👁 1 views

We present a new short combinatorial proof of the sufficiency part of the well-known Kuratowski's graph planarity criterion. The main steps are to prove that for a minor minimal non-planar graph G and any edge xy: (1) G-x-y does not contain θ-subgraph; (2) G-x-y is homeomorphic to the circle; (3)

A new proof of the Caffarelli-Kohn-Niren
✍ Fanghua Lin 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 220 KB 👁 1 views

Here we give a self-contained new proof of the partial regularity theorems for solutions of incompressible Navier-Stokes equations in three spatial dimensions. These results were originally due to Scheffer and Caffarelli, Kohn, and Nirenberg. Our proof is much more direct and simpler.