On the duality of semiantichains and unichain coverings. (Q5965139): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11083-015-9348-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148328298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berge's conjecture on directed path partitions -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: News about Semiantichains and Unichain Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On nested chain decompositions of normalized matching posets of rank 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some partitions associated with a partially ordered set / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of Sperner k-families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196436 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient Conditions for a Symmetric Chain Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chains and Sperner k-families in ranked posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings, cutsets, and chain partitions in graded posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality for semiantichains and unichain coverings in products of special posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the existence of k-saturated partitions of partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiantichains and Unichain Coverings in Direct Products of Partial Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks and chain coverings in partial orders and their products / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two easy duality theorems for product partial orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nested chain partitions of LYM posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Poly-unsaturated'' posets: The Greene-Kleitman theorem is best possible / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unichain coverings in partial orders with the nested saturation property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Skew chain orders and sets of rectangles / rank
 
Normal rank

Latest revision as of 13:17, 11 July 2024

scientific article; zbMATH DE number 6548274
Language Label Description Also known as
English
On the duality of semiantichains and unichain coverings.
scientific article; zbMATH DE number 6548274

    Statements

    On the duality of semiantichains and unichain coverings. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 March 2016
    0 references
    A min-max conjecture of Saks and West states that in every product \(P\times Q\) of two posets, the size of the largest semiantichain equals the size of the smallest unichain covering. A counterexample to this conjecture with \(9\times 3=27\) elements is exhibited and it is the only one with size 27 or less. Moreover, it is shown that the size of the gap between the two sizes can be, in general, arbitrarily high. On the other side, the validity of the conjecture is shown in other cases, like: 1. When \(P\) and \(Q\) have height at most 2. 2. When \(P\) is ``rectangular'' and \(Q\) is an arbitrary poset. -- A new framework which uses the concepts of c- and d-decomposability of posets is provided, as well.
    0 references
    products of posets
    0 references
    unichain coverings
    0 references
    semiantichains
    0 references
    poset duality
    0 references
    Saks-West conjecture
    0 references

    Identifiers