✦ LIBER ✦

A very short proof of Dixon's theorem

✍ Scribed by Shalosh B Ekhad

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 56 KB
Volume: 54
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(90)90014-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Short Proofs of Saalschütz's and Dixon's

Short Proofs of Saalschütz's and Dixon's theorems

✍ Ira Gessel; Dennis Stanton 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 146 KB

A short proof of Chvátal's Watchman Theo

A short proof of Chvátal's Watchman Theorem

✍ Steve Fisk 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 45 KB

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 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 short proof of Martindale's theorem on

A short proof of Martindale's theorem on GPIs

✍ Chen-Lian Chuang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 223 KB