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)\...

Descrición completa

Detalles Bibliográficos
Main Authors: Abraham, Uri, Pouzet, Maurice
Formato: Artigo
Idioma:English
Publicado: Académie des sciences 2023-10-01
Series:Comptes Rendus. Mathématique
Acceso en liña:https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.511/