AbstractThe theorem of Greene and Kleitman concerning the existence of k-saturated partitions for any partially ordered set P is proved by applying Dilworth's theorem to the product partial order of P with a chain of length k
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractThe theorem of Greene and Kleitman concerning the existence of k-saturated partitions for an...
AbstractThe theory of saturated chain partitions of partial orders is applied to the minimum unichai...
AbstractUsing linear programming we prove a generalization of Greene and Kleitman's generalization o...
For positive integers m and n let L(m, n) denote the set of all m-tuples (a1, a2..., am) of integers...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractFor any partially ordered set P, let dk(P)(d̂k(P)) denote the cardinality of the largest sub...
AbstractFor any partially ordered set P, let dk(P)(d̂k(P)) denote the cardinality of the largest sub...
AbstractIf P is a partially ordered set, a k-family of P is a subset which contains no chains of len...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
AbstractThe theorem of Greene and Kleitman concerning the existence of k-saturated partitions for an...
AbstractThe theory of saturated chain partitions of partial orders is applied to the minimum unichai...
AbstractUsing linear programming we prove a generalization of Greene and Kleitman's generalization o...
For positive integers m and n let L(m, n) denote the set of all m-tuples (a1, a2..., am) of integers...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
AbstractFor any partially ordered set P, let dk(P)(d̂k(P)) denote the cardinality of the largest sub...
AbstractFor any partially ordered set P, let dk(P)(d̂k(P)) denote the cardinality of the largest sub...
AbstractIf P is a partially ordered set, a k-family of P is a subset which contains no chains of len...
A partition of a set A is a set of nonempty pairwise disjoint subsets of A whose union is A. An equi...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for ...
If P is a partially ordered set, a k-family of P is a subset which contains no chains of length k + ...
AbstractA partition of a finite poset into chains places a natural upper bound on the size of a unio...
AbstractThe simultaneously k- and (k − 1)-saturated chain partitions of a finite partially ordered s...
DOI
Add to ORKG