Abstract
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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 75-83 |
| Number of pages | 9 |
| Journal | Order |
| Volume | 5 |
| Issue number | 1 |
| DOIs | |
| State | Published - Mar 1988 |
| Externally published | Yes |
Keywords
- AMS subject classifications (1980): 06A10, 54D30
- Menger's theorem
- Ordered set
- cutset
- maximal chain
ASJC Scopus subject areas
- Algebra and Number Theory
- Geometry and Topology
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'A minimax theorem for chain complete ordered sets'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS