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.
✦ LIBER ✦
Uniqueness of the Core for Chain-Complete Ordered Sets
✍ Scribed by Bernd S. W. Schröder
- Book ID
- 111564517
- Publisher
- Springer Netherlands
- Year
- 2000
- Tongue
- English
- Weight
- 65 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
A minimax theorem for chain complete ord
✍
Henry A. Kierstead
📂
Article
📅
1988
🏛
Springer Netherlands
🌐
English
⚖ 513 KB
✍
Jason Anspach; Nick Cole; Josh Hayes; Richard Fox; Jonathan Yanez; J.R. Handley
📂
Fiction
📅
2023
🏛
Galaxy's Edge Press
🌐
English
⚖ 656 KB
A computer program for the generation of
✍
Rouse, K. D. ;Sayers, R. ;Cooper, M. J.
📂
Article
📅
1977
🏛
International Union of Crystallography
🌐
English
⚖ 241 KB
The Lattice of Completions of an Ordered
✍
J. B. Nation; Alex Pogel
📂
Article
📅
1997
🏛
Springer Netherlands
🌐
English
⚖ 178 KB
Uniqueness of the implication for totall
✍
Néstor G. Martı́nez; Alejandro Petrovich
📂
Article
📅
2001
🏛
Elsevier Science
🌐
English
⚖ 90 KB
It is shown that in a linearly ordered MV-algebra A, the implication is unique if and only if the identity function is the unique De Morgan automorphism on A. Modulo categorical equivalence, our uniqueness criterion recalls Ohkuma's rigidness condition for totally ordered abelian groups. We also sho
Complete Set of Eigenfunctions of the Qu
✍
Daniel An
📂
Article
📅
2009
🏛
Springer
🌐
English
⚖ 191 KB