The chain covering number of a poset with no infinite antichains
The chain covering number $\operatorname{Cov}(P)$ of a poset $P$ is the least number of chains needed to cover $P$. For an uncountable cardinal $\nu $, we give a list of posets of cardinality and covering number $\nu $ such that for every poset $P$ with no infinite antichain, $\operatorname{Cov}(P)\...
| المؤلفون الرئيسيون: | , |
|---|---|
| التنسيق: | مقال |
| اللغة: | English |
| منشور في: |
Académie des sciences
2023-10-01
|
| سلاسل: | Comptes Rendus. Mathématique |
| الوصول للمادة أونلاين: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.511/ |