✦ LIBER ✦

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

✍ Scribed by Ira Gessel; Dennis Stanton

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 146 KB
Volume: 38
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(85)90026-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A very short proof of Dixon's theorem

✍ Shalosh B Ekhad 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 56 KB

Short proofs of classical theorems

✍ J. A. Bondy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 81 KB

## Abstract We give proofs of Ore's theorem on Hamilton circuits, Brooks' theorem on vertex coloring, and Vizing's theorem on edge coloring, as well as the Chvátal‐Lovász theorem on semi‐kernels, a theorem of Lu on spanning arborescences of tournaments, and a theorem of Gutin on diameters of orient

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 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

A short proof of Catlin's extension of B

A short proof of Catlin's extension of Brooks' theorem

✍ John Mitchem 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 262 KB

Recently, in [3], Catlin proved the following extension of Brooks' Theorem [2]. T&eortln 1. Let G be u connected graph with muximcrm degree A(G) = h. If G is neither complete nor an odd cycle, then there exists an h-coloring of G with a monmhromatic maximum independent set. In addition to being of s