AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-inequality and the Sperner property, for the Boolean interval lattice. Furthermore, the Bollobas inequality for the Boolean interval lattice turns out to be just the LYM-inequality for the Boolean lattice. We also present an Intersection Theorem for this lattice.Perhaps more surprising is that by our approach the conjecture of P. L. Erdöset al.[7] and Z. Füredi concerning an Erdös–Ko–Rado-type intersection property for the poset of Boolean chains could also be established. In fact, we give two seemingly elegant proofs
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
Abstract. We prove that a bounded poset of finite length is a lattice if and only if the following c...
AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-ineq...
Ahlswede R, Cai N. Incomparability and intersection properties of Boolean interval lattices and chai...
AbstractWe give pseudo-LYM inequalities in some posets and we give a new restriction in this way for...
AbstractConsider any sets x⊆y⊆{1,…,n}. Remove the interval [x,y]={z⊆y|x⊆z} from the Boolean lattice ...
AbstractFor each word w in the Fibonacci lattices Fib(r) and Z(r) we partition the interval [0̂,w] i...
Ahlswede R, Cai N. A generalization of the AZ identity. Combinatorica. 1993;13(3):241-247.The identi...
AbstractRelated to activities in matroids, J.E. Dawson introduced a construction that leads to parti...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,…,n} ord...
AbstractThe powerful AZ identity is a sharpening of the famous LYM-inequality. More generally, Ahlsw...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,…,n} ord...
Let (Formula presented.) be the poset generated by the subsets of [n] with the inclusion relation an...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
Abstract. We prove that a bounded poset of finite length is a lattice if and only if the following c...
AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-ineq...
Ahlswede R, Cai N. Incomparability and intersection properties of Boolean interval lattices and chai...
AbstractWe give pseudo-LYM inequalities in some posets and we give a new restriction in this way for...
AbstractConsider any sets x⊆y⊆{1,…,n}. Remove the interval [x,y]={z⊆y|x⊆z} from the Boolean lattice ...
AbstractFor each word w in the Fibonacci lattices Fib(r) and Z(r) we partition the interval [0̂,w] i...
Ahlswede R, Cai N. A generalization of the AZ identity. Combinatorica. 1993;13(3):241-247.The identi...
AbstractRelated to activities in matroids, J.E. Dawson introduced a construction that leads to parti...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,…,n} ord...
AbstractThe powerful AZ identity is a sharpening of the famous LYM-inequality. More generally, Ahlsw...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,…,n} ord...
Let (Formula presented.) be the poset generated by the subsets of [n] with the inclusion relation an...
AbstractWe establish a homomorphism of finite linear lattices onto the Boolean lattices via a group ...
The structure of the lattice of all subposets of a fixed poset is explored. This lattice is then use...
. Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a d...
Abstract. We prove that a bounded poset of finite length is a lattice if and only if the following c...