𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A short proof of Martindale's theorem on GPIs

✍ Scribed by Chen-Lian Chuang

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
223 KB
Volume
151
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Short Proof of Mader's S-Paths Theorem
A Short Proof of Mader's S-Paths Theorem
✍ Alexander Schrijver πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 78 KB

For an undirected graph G=(V, E) and a collection S of disjoint subsets of V, an S-path is a path connecting different sets in S. We give a short proof of Mader's min-max theorem for the maximum number of disjoint S-paths. 2001

A short proof of a theorem on Hamiltonia
A short proof of a theorem on Hamiltonian graphs
✍ 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 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