2006/06/01 by Assaf Rinot, Rinot, Assaf
Computer Science · Decision Sciences · Mathematics · #03E04 #03E35 #06A07 #Advanced Algebra and Logic #Advanced Topology and Set Theory #Combinatorics (math.CO) #FOS: Mathematics #Fuzzy and Soft Set Theory #Logic (math.LO)
paper · pdf · doi:10.48550/arxiv.math/0606021
openalex publication_date 2006/06/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In their paper from 1981, Milner and Sauer conjectured that for any poset P, if cf(P)=lambda>cf(lambda)=kappa, then P must contain an antichain of size kappa. We prove that for lambda>cf(lambda)=kappa, if there exists a cardinal mu