The size of maximum antichains in the product of n linear orders is known when the n linear orders have the same length. We present an exact expression for the size of maximum antichains when the linear orders have (possibly) different lengths. From this, we derive an exact expression for the size of maximum antichains in the product of n linear orders with the same length. This expression is equivalent to but different from the existing expression. It allows us to present an asymptotic result for the size of maximum antichains of n linear orders with the same length m going to infinity
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractWe consider the random poset P(n,p) which is generated by first selecting each subset of [n]...
We present new exact and asymptotic results about the size of the largest antichain in the product o...
We discuss a problem proposed by Brualdi and Deaett on the largest size of an antichain in the Bruha...
Let n ⩾4 be a natural number, and let K be a set K⊆[n]:={1,2,...,n}. We study the problem of finding...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
AbstractWe consider A(n,k)=maxA{|A|:dim(A)⩽k, A⊂{0,1}n is an antichain}, where the dimension is take...
We present two results on maximal antichains in the strict chain product poset $[t_1+1]\times[t_2+1]...
AbstractWe expose a relationship of the jump number s(P) and the length of the lattic of maximal ant...
AbstractGiven 2 ⩽ m ⩽ n, let P(m, n) be the family of partially ordered sets on {1, 2, …, n} in whic...
AbstractFor six natural notions of cloud-antichains in a partially ordered set P we determine asympt...
Ahlswede R, Khachatrian LH. The maximal length of cloud-antichains. Discrete Mathematics. 1994;131(1...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractA popular model of random orders is obtained by taking two disjoint n-element antichains A1 ...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractWe consider the random poset P(n,p) which is generated by first selecting each subset of [n]...
We present new exact and asymptotic results about the size of the largest antichain in the product o...
We discuss a problem proposed by Brualdi and Deaett on the largest size of an antichain in the Bruha...
Let n ⩾4 be a natural number, and let K be a set K⊆[n]:={1,2,...,n}. We study the problem of finding...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
AbstractWe consider A(n,k)=maxA{|A|:dim(A)⩽k, A⊂{0,1}n is an antichain}, where the dimension is take...
We present two results on maximal antichains in the strict chain product poset $[t_1+1]\times[t_2+1]...
AbstractWe expose a relationship of the jump number s(P) and the length of the lattic of maximal ant...
AbstractGiven 2 ⩽ m ⩽ n, let P(m, n) be the family of partially ordered sets on {1, 2, …, n} in whic...
AbstractFor six natural notions of cloud-antichains in a partially ordered set P we determine asympt...
Ahlswede R, Khachatrian LH. The maximal length of cloud-antichains. Discrete Mathematics. 1994;131(1...
Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, 2016.Cataloged fro...
AbstractA popular model of random orders is obtained by taking two disjoint n-element antichains A1 ...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractWe consider the random poset P(n,p) which is generated by first selecting each subset of [n]...