✦ LIBER ✦

On the lattice of maximum-sized antichains of a finite poset

✍ Scribed by K. M. Koh

Book ID: 111960639
Publisher: Springer
Year: 1983
Tongue: English
Weight: 548 KB
Volume: 17
Category: Article
ISSN: 0002-5240
DOI: 10.1007/bf01194515

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing on-line the lattice of maximal

Computing on-line the lattice of maximal antichains of posets

✍ Guy-Vincent Jourdan; Jean-Xavier Rampon; Claude Jard 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 940 KB

Size of the Largest Antichain in a Parti

Size of the Largest Antichain in a Partition Poset

✍ V. M. Blinovsky; L. H. Harper 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 122 KB

About the ratio of the size of a maximum

About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets

✍ Konrad Engel; Nikolaj Nikolajevič Kuzjurin 📂 Article 📅 1985 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

The lattice of strict completions of a f

The lattice of strict completions of a finite poset

✍ G. H. Bordalo; B. Monjardet 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 328 KB

Maximum Antichains in Random Subsets of

Maximum Antichains in Random Subsets of a Finite Set

✍ Deryk Osthus 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p

No Finite–Infinite Antichain Duality in

No Finite–Infinite Antichain Duality in the Homomorphism Poset of Directed Graphs

✍ Péter L. Erdős; Lajos Soukup 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 328 KB