𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chain partitions of ordered sets

✍ Scribed by Willem L. Fouché

Publisher
Springer Netherlands
Year
1996
Tongue
English
Weight
651 KB
Volume
13
Category
Article
ISSN
0167-8094

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On-line chain partitions of orders
On-line chain partitions of orders
✍ Stefan Felsner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 698 KB

We analyze the on-line chain partitioning problem as a two-person game. One person builds an order one point at a time. The other person responds by making an irrevocable assignment of the new point to a chain of a chain partition. Kierstead gave a strategy showing that width k orders can be on-line

A minimax theorem for chain complete ord
A minimax theorem for chain complete ordered sets
✍ Henry A. Kierstead 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 513 KB

It is shown that if a chain complete ordered set does not have k+ 1 pairwise disjoint maximal chains for some finite k, then the minimum size of a cutset is equal to the maximum size of a collection of pairwise disjoint maximal chains. This answers a question of Pouzet and Zaguia.