✦ LIBER ✦

A short proof of the inclusion of the core in the Weber set

✍ Scribed by J. J. M. Derks

Publisher: Springer-Verlag
Year: 1992
Tongue: English
Weight: 63 KB
Volume: 21
Category: Article
ISSN: 0020-7276
DOI: 10.1007/bf01245457

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Cores of cooperative games and th

On the Cores of cooperative games and the stability of the Weber set

✍ Carles Rafels; Stef Tijs 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 402 KB

A short proof of the existence of k-satu

A short proof of the existence of k-saturated partitions of partially ordered sets

✍ Michael Saks 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 258 KB

A short proof of the Oslo algorithm

✍ Hartmut Prautzsch 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 73 KB

A nominalistic proof of the conservative

A nominalistic proof of the conservativeness of set theory

✍ Hartry Field 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 629 KB

A Short Proof of the Littlewood–Richards

A Short Proof of the Littlewood–Richardson Rule

✍ V. Gasharov 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 73 KB

We give an involution type proof of the Littlewood-Richardson rule.

A short proof of the Chen-Manalastas the

A short proof of the Chen-Manalastas theorem

✍ J.A. Bondy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Gallai and Milgram (1960) proved that a digraph with stability number ct is spanned by ct disjoint directed paths. Chen and Manalastas Jr (1983) proved that a strong digraph with stability number at most two is spanned by at most two consistent directed circuits. We slightly simplify the proof of