✦ LIBER ✦

Every finite distributive lattice is a set of stable matchings

✍ Scribed by Charles Blair

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 198 KB
Volume: 37
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(84)90056-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Every finite distributive lattice is a s

Every finite distributive lattice is a set of stable matchings for a small stable marriage instance

✍ Dan Gusfield; Robert Irving; Paul Leather; Michael Saks 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 311 KB

On finite set-systems whose every inters

On finite set-systems whose every intersection is a Kernel of a star

✍ Z. Füredi 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Let k, t be positive integers and let 9 be a set-system which consists of k-element sets. In this paper it is proved that one can choose a subsystem 9\* c 9F containing a positive proportion of the members of 9, (i.e. 145\*1 >c(k, t) IsSj) and having the property that every pairwise intersection is

The density of a maximum minimal cut in

The density of a maximum minimal cut in the subset lattice of a finite set is almost one

✍ Feng Shi; Weixuan Li 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 319 KB