✦ LIBER ✦

Partitioning Boolean lattices into chains of subsets

✍ Scribed by Jerrold R. Griggs; Roger K. -C. Yeh; Charles M. Grinstead

Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 167 KB
Volume: 4
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00346654

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partitioning the Boolean Lattice into Ch

Partitioning the Boolean Lattice into Chains of Large Minimum Size

✍ Tim Hsu; Mark J. Logan; Shahriar Shahriari; Christopher Towse 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Let 2 [n] denote the Boolean lattice of order n, that is, the poset of subsets of {1, ..., n} ordered by inclusion. Recall that 2 [n] may be partitioned into what we call the canonical symmetric chain decomposition (due to de Bruijn, Tengbergen, and Kruyswijk), or CSCD. Motivated by a question of Fü

Partitions of large Boolean lattices

✍ Zbigniew Lonc 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 482 KB

Let 2" be the ordered set obtained from the Boolean lattice 2" by deleting both the greatest and the least elements. Definef(n) to be the minimum number k such that there is a partition of 2" into k antichains of the same size except for at most one antichain of a smaller size. In the paper we exami

The length of random subsets of Boolean

The length of random subsets of Boolean lattices

✍ Y. Kohayakawa; B. Kreuter; D. Osthus 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB 👁 3 views

We form the random poset P P n, p by including each subset of n s 1, . . . , n with probability p and ordering the subsets by inclusion. We investigate the length of the Ž . longest chain contained in P P n, p . For p G ern we obtain the limit distribution of this random variable. For smaller p we g

The Width of Random Subsets of Boolean L

The Width of Random Subsets of Boolean Lattices

✍ Y. Kohayakawa; B. Kreuter 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Suppose we toss an independent coin with probability of success p for each subset of ½n ¼ f1; . . . ; ng; and form the random hypergraph Pðn; pÞ by taking as hyperedges the subsets with successful coin tosses. We investigate the cardinality of the largest Sperner family contained in Pðn; pÞ: We obta

Small sublattices in random subsets of B

Small sublattices in random subsets of Boolean lattices

✍ B. Kreuter 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB 👁 3 views

In this article, we determine the probability of existence of small lattices in random subsets of a Boolean lattice. Furthermore, we address some Ramsey-and Turan-type questions. Analogous questions have been studied extensively for random graphs, but it turns out that the situation for Boolean lat

On lattices embeddable into lattices of

On lattices embeddable into lattices of algebraic subsets

✍ Marina Semenova 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 186 KB