✦ LIBER ✦

Three LayerQ2-Free Families in the Boolean Lattice

✍ Scribed by Jacob Manske, Jian Shen

Book ID: 120755360
Publisher: Springer Netherlands
Year: 2012
Tongue: English
Weight: 298 KB
Volume: 30
Category: Article
ISSN: 0167-8094
DOI: 10.1007/s11083-012-9263-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Q2-free Families in the Boolean Lattice

✍ Maria Axenovich; Jacob Manske; Ryan Martin 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 389 KB

On diamond-free subposets of the Boolean

On diamond-free subposets of the Boolean lattice

✍ Kramer, Lucas; Martin, Ryan R.; Young, Michael 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 264 KB

The three-loop lattice free energy

✍ B. Allés; M. Campostrini; A. Feo; H. Panagopoulos 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 214 KB

Long Symmetric Chains in the Boolean Lat

Long Symmetric Chains in the Boolean Lattice

✍ Béla Bajnok; Shahriar Shahriari 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Let 2 [n] be the poset of all subsets of a set with n elements ordered by inclusion. A long chain in this poset is a chain of n&1 subsets starting with a subset with one element and ending with a subset with n&1 elements. In this paper we prove: Given any collection of at most n&2 skipless chains in

The free implicative semi-lattice on thr

The free implicative semi-lattice on three generators

✍ W. J. Landolt; T. P. Whaley 📂 Article 📅 1976 🏛 Springer 🌐 English ⚖ 282 KB

The t-intersection Problem in the Trunca

The t-intersection Problem in the Truncated Boolean Lattice

✍ Rudolf Ahlswede; Christian Bey; Konrad Engel; Levon H. Khachatrian 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let I (n, t) be the class of all t-intersecting families of subsets of [n] and set ≤k . After the maximal families in I (n, t) [13] and in I k (n, t) [1,9] are known we study now maximal families in I ≤k (n, t). We present a conjecture about the maximal cardinalities and prove it in several cases.