DOIAbstract
AbstractWe give pseudo-LYM inequalities in some posets and we give a new restriction in this way for their antichains. Typically these posets fail the LYM inequality and some of them are known to not be Sperner
AbstractWe give pseudo-LYM inequalities in some posets and we give a new restriction in this way for their antichains. Typically these posets fail the LYM inequality and some of them are known to not be Sperner
Ahlswede R, Cai N. A generalization of the AZ identity. Combinatorica. 1993;13(3):241-247.The identi...
AbstractLet Pin be the poset of partitions of an integer n, ordered by refinement. Let b(Pin) be the...
AbstractConsider two set systems A and B in the powerset P(n) with the property that for eachA∈A the...
AbstractWe give pseudo-LYM inequalities in some posets and we give a new restriction in this way for...
AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-ineq...
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special chara...
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special chara...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
AbstractThe powerful AZ identity is a sharpening of the famous LYM-inequality. More generally, Ahlsw...
AbstractA long-standing conjecture states that all LYM posets possess nested chain partitions. We ve...
AbstractA subset A of a poset P is a q-antichain if it can be obtained as the union of at most q ant...
AbstractConsider any sets x⊆y⊆{1,…,n}. Remove the interval [x,y]={z⊆y|x⊆z} from the Boolean lattice ...
AbstractWe prove that for each integer l > 1 there exists a number r = r(l) > 1 such that every fini...
Ahlswede R, Cai N. A generalization of the AZ identity. Combinatorica. 1993;13(3):241-247.The identi...
AbstractLet Pin be the poset of partitions of an integer n, ordered by refinement. Let b(Pin) be the...
AbstractConsider two set systems A and B in the powerset P(n) with the property that for eachA∈A the...
AbstractWe give pseudo-LYM inequalities in some posets and we give a new restriction in this way for...
AbstractIn a canonical way, we establish an AZ-identity (see [2]) and its consequences, the LYM-ineq...
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special chara...
In a ranked partially ordered set (poset) [special characters omitted], an anti-chain [special chara...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
We consider ‘supersaturation’ problems in partially ordered sets (posets) of the following form. Giv...
AbstractThe powerful AZ identity is a sharpening of the famous LYM-inequality. More generally, Ahlsw...
AbstractA long-standing conjecture states that all LYM posets possess nested chain partitions. We ve...
AbstractA subset A of a poset P is a q-antichain if it can be obtained as the union of at most q ant...
AbstractConsider any sets x⊆y⊆{1,…,n}. Remove the interval [x,y]={z⊆y|x⊆z} from the Boolean lattice ...
AbstractWe prove that for each integer l > 1 there exists a number r = r(l) > 1 such that every fini...
Ahlswede R, Cai N. A generalization of the AZ identity. Combinatorica. 1993;13(3):241-247.The identi...
AbstractLet Pin be the poset of partitions of an integer n, ordered by refinement. Let b(Pin) be the...
AbstractConsider two set systems A and B in the powerset P(n) with the property that for eachA∈A the...
Add to ORKG