News about semiantichains and unichain coverings.

From MaRDI portal
Publication:2907485

DOI10.1007/978-3-642-30642-6_5zbMATH Open1344.06001arXiv1401.1225OpenAlexW150545534MaRDI QIDQ2907485FDOQ2907485


Authors: Bartłomiej Bosek, Stefan Felsner, Kolja Knauer, Grzegorz Matecki Edit this on Wikidata


Publication date: 10 September 2012

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Abstract: 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 product PimesQ are equal. For positive we state conditions on P and Q that imply the min-max relation. Based on these conditions we identify some new families of posets where the conjecture holds and get easy proofs for several instances where the conjecture had been verified before. However, we also have examples showing that in general the min-max relation is false, i.e., we disprove the Saks-West conjecture.


Full work available at URL: https://arxiv.org/abs/1401.1225




Recommendations




Cites Work


Cited In (3)





This page was built for publication: News about semiantichains and unichain coverings.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907485)