DOIAbstract
AbstractFor six natural notions of cloud-antichains in a partially ordered set P we determine asymptotically their maximal lengths if P is the family of all subsets of a finite set. Actually, in three cases we even have exact results
AbstractFor six natural notions of cloud-antichains in a partially ordered set P we determine asymptotically their maximal lengths if P is the family of all subsets of a finite set. Actually, in three cases we even have exact results
We present new exact and asymptotic results about the size of the largest antichain in the product o...
AbstractAn h-family of a partially ordered set P is a subset of P such that no h + 1 elements of the...
Let n> 3 be a natural number. We study the problem to find the smallest r such that there is a fa...
Ahlswede R, Khachatrian LH. The maximal length of cloud-antichains. Discrete Mathematics. 1994;131(1...
Ahlswede R, Zhang Z. On cloud-antichains and related configurations. Discrete Mathematics. 1990;85(3...
AbstractWe introduce the concept of a cloud-antichain, which is a natural generalization of antichai...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
AbstractWe expose a relationship of the jump number s(P) and the length of the lattic of maximal ant...
Let n ⩾4 be a natural number, and let K be a set K⊆[n]:={1,2,...,n}. We study the problem of finding...
The size of maximum antichains in the product of n linear orders is known when the n linear orders h...
AbstractWe consider the random poset P(n,p) which is generated by first selecting each subset of [n]...
AbstractRecently there has been a good deal of interest in the maximal sized antichains of a partial...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
We present new exact and asymptotic results about the size of the largest antichain in the product o...
AbstractAn h-family of a partially ordered set P is a subset of P such that no h + 1 elements of the...
Let n> 3 be a natural number. We study the problem to find the smallest r such that there is a fa...
Ahlswede R, Khachatrian LH. The maximal length of cloud-antichains. Discrete Mathematics. 1994;131(1...
Ahlswede R, Zhang Z. On cloud-antichains and related configurations. Discrete Mathematics. 1990;85(3...
AbstractWe introduce the concept of a cloud-antichain, which is a natural generalization of antichai...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
AbstractWe expose a relationship of the jump number s(P) and the length of the lattic of maximal ant...
Let n ⩾4 be a natural number, and let K be a set K⊆[n]:={1,2,...,n}. We study the problem of finding...
The size of maximum antichains in the product of n linear orders is known when the n linear orders h...
AbstractWe consider the random poset P(n,p) which is generated by first selecting each subset of [n]...
AbstractRecently there has been a good deal of interest in the maximal sized antichains of a partial...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
We present new exact and asymptotic results about the size of the largest antichain in the product o...
AbstractAn h-family of a partially ordered set P is a subset of P such that no h + 1 elements of the...
Let n> 3 be a natural number. We study the problem to find the smallest r such that there is a fa...
Add to ORKG