arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2004.02162math.CO
收藏

Dilworth's Theorem for Borel Posets

Bartłomiej Bosek, Jarosław Grytczuk, Zbigniew Lonc

英文摘要:

A famous theorem of Dilworth asserts that any finite poset of width $k$ can be decomposed into $k$ chains. We study the following problem: given a Borel poset $P$ of finite width $k$, is it true that it can be decomposed into $k$ Borel chains? We give a positive answer in a special case of Borel posets embeddable into the real line. We also prove a dual theorem for posets whose comparability graphs are locally countable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑