✦ LIBER ✦

Forbidden configurations for distributive and modular ordered sets

✍ Scribed by Ivan Chajda; Jiří Rachůnek

Publisher: Springer Netherlands
Year: 1989
Tongue: English
Weight: 601 KB
Volume: 5
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00353659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Avoidable structures, II: Finite distrib

Avoidable structures, II: Finite distributive lattices and nicely structured ordered sets

✍ Wieslaw Dziobiak; Jaroslav Ježek; Ralph McKenzie 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 376 KB

Generating sets for catalytic and protec

Generating sets for catalytic and protective distributive lattices

✍ Raymond Balbes 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 313 KB

Tree-Properties for Ordered Sets

✍ Olivier Esser; Roland Hinnion 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 142 KB

In this paper, we study the notion of arborescent ordered sets, a generalization of the notion of tree-property for cardinals. This notion was already studied previously in the case of directed sets. Our main result gives a geometric condition for an order to be ℵ0-arborescent.

Searching and encoding for infinite orde

Searching and encoding for infinite ordered sets

✍ Quentin F. Stout 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 960 KB

Combinatorial Criteria for Ramifiable Or

Combinatorial Criteria for Ramifiable Ordered Sets

✍ Olivier Esser; Roland Hinnion 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 251 KB

Some intersection theorems for ordered s

Some intersection theorems for ordered sets and graphs

✍ F.R.K Chung; R.L Graham; P Frankl; J.B Shearer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 642 KB