Saks-West conjecture on semiantichains and unichain coverings
Let and be posets. A unichain in is a chain of the form or , where and are chains in and , respectively. A semiantichain is a subset such that no two distinct elements of are contained in a unichain.
Saks-West conjecture. In every product of two posets, the size of a largest semiantichain equals the size of a smallest unichain covering.
This conjecture generalizes the Greene–Kleitman theorem and its equivalent formulation for products of a chain with a poset. It proposes a min–max relation between semiantichains and unichain coverings for arbitrary products of two posets; the supplied source does not indicate whether it has been resolved.
References
- Bartłomiej Bosek, Stefan Felsner, Kolja Knauer and Grzegorz Matecki, “On the Duality of Semiantichains and Unichain Coverings”, arXiv:1401.1225 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.