Add to ORKGWe exhibit a recursive procedure that enables us to construct a maximal union of k chains in a finite partially ordered set P for every positive integer k. As a consequence, we obtain an algorithmic proof of Greene's Duality Theorem on the relations between the cardinalities of maximal unions of chains and antichains in a finite poset
Summary. The following theorem is due to Dilworth [?]: Let P be a partially ordered set. If the maxi...
Summary. The following theorem is due to Dilworth [?]: Let P be a partially ordered set. If the maxi...
Ahlswede R, Erdős PL, Graham N. A splitting property of maximal antichains. Combinatorica. 1995;15(4...
We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a finit...
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractFor a given poset and positive integer κ, four problems are considered. Covering: Determine ...
AbstractFix integers n and k with n≥k≥3. Duffus and Sands proved that if P is a finite poset and n≤|...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
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...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
AbstractAfibre in a partially ordered set P is a subset of P meeting every maximal antichain of P. W...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
Summary. The following theorem is due to Dilworth [?]: Let P be a partially ordered set. If the maxi...
Summary. The following theorem is due to Dilworth [?]: Let P be a partially ordered set. If the maxi...
Ahlswede R, Erdős PL, Graham N. A splitting property of maximal antichains. Combinatorica. 1995;15(4...
We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a finit...
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
AbstractFor each integer k≥3, we find all maximal intervals Ik of natural numbers with the following...
AbstractFor a given poset and positive integer κ, four problems are considered. Covering: Determine ...
AbstractFix integers n and k with n≥k≥3. Duffus and Sands proved that if P is a finite poset and n≤|...
AbstractA common generalization of the theorems of Greene and Greene and Kleitman is presented. This...
Let P be a nite partially ordered set. Dilworth's theorem states that the maximal size of an an...
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...
AbstractThe following general theorem is proven: Given a partially ordered set and a group of permut...
AbstractAfibre in a partially ordered set P is a subset of P meeting every maximal antichain of P. W...
summary:Let $\Bbb G$ and $\Bbb D$, respectively, denote the partially ordered sets of homomorphism c...
Summary. The following theorem is due to Dilworth [?]: Let P be a partially ordered set. If the maxi...
Summary. The following theorem is due to Dilworth [?]: Let P be a partially ordered set. If the maxi...
Ahlswede R, Erdős PL, Graham N. A splitting property of maximal antichains. Combinatorica. 1995;15(4...