Some Remarks on Nestings in the Normalized Matching Posets of Rank 3

YL Chang, WT Li - Order, 2019 - Springer
In 1970s, Griggs conjectured that every normalized matching rank-unimodal poset has a
nested chain decomposition. This conjecture is proved to be true only for some posets of …

News about semiantichains and unichain coverings

B Bosek, S Felsner, K Knauer, G Matecki - International Computer Science …, 2012 - Springer
We study a min-max relation conjectured by Saks and West: For any two posets P and Q the
size of a maximum semiantichain and the size of a minimum unichain covering in the …

Some Sufficient Conditions for Finding a Nesting of the Normalized Matching Posets of Rank 3

YL Chang, WT Li - arXiv preprint arXiv:1709.01768, 2017 - arxiv.org
Given a graded poset $ P $, consider a chain decomposition $\mathcal {C} $ of $ P $. If $|
C_1|\le| C_2| $ implies that the set of the ranks of elements in $ C_1 $ is a subset of the …

On the Duality of Semiantichains and Unichain Coverings

B Bosek, S Felsner, K Knauer, G Matecki - Order, 2016 - Springer
We study a min-max relation conjectured by Saks and West: For any two posets P and Q the
size of a maximum semiantichain and the size of a minimum unichain covering in the …

[PDF][PDF] On the Duality of Semiantichains and Unichain Coverings

B lomiej Bosek, S Felsner, K Knauer, G Matecki - hal.science
We study a min-max relation conjectured by Saks and West: For any two posets P and Q the
size of a maximum semiantichain and the size of a minimum unichain covering in the …

News about Semiantichains and Unichain Coverings

B lomiej Bosek, S Felsner, K Knauer, G Matecki - Edward A. Hirsch Juhani … - Springer
We study a min-max relation conjectured by Saks and West: For any two posets P and Q the
size of a maximum semiantichain and the size of a minimum unichain covering in the …