✦ LIBER ✦

Ordered sets with no infinite antichains

✍ Scribed by J.D. Lawson; M. Mislove; H. Priestley

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 420 KB
Volume: 63
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(87)90010-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complete subgraphs of infinite multipart

Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets

✍ A. Hajnal; N. Sauer 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 393 KB

A note on maximal antichains in ordered

A note on maximal antichains in ordered sets

✍ R. Maltby; S. Williamson 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 611 KB

Some properties of antichains of partial

Some properties of antichains of partially ordered sets

✍ L. E. Kornilova; Yu. V. Voitishin 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 302 KB

Antichains in partially ordered sets of

Antichains in partially ordered sets of singular cofinality

✍ Assaf Rinot 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 177 KB

A chain complete poset with no infinite

A chain complete poset with no infinite antichain has a finite core

✍ Boyu Li; E. C. Milner 📂 Article 📅 1993 🏛 Springer Netherlands 🌐 English ⚖ 613 KB

The Menger property for infinite ordered

The Menger property for infinite ordered sets

✍ R. Aharoni; J. -M. Brochet; M. Pouzet 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 549 KB

It is shown that, if an ordered set P contains at most k pairwise disjoint maximal chains, where k is finite, then every finite family of maximal chains in P has a cutset of size at most k. As a corollary of this, we obtain the following Menger-type result that, if in addition, P contains k pairwise