Duality for semiantichains and unichain coverings in products of special posets (Q1013994): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfectness of sums of graphs / 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: Partially Ordered Sets / 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: Q5598298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect product graphs / 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: Unichain coverings in partial orders with the nested saturation property / 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: Q4245024 / rank
 
Normal rank

Revision as of 11:51, 1 July 2024

scientific article
Language Label Description Also known as
English
Duality for semiantichains and unichain coverings in products of special posets
scientific article

    Statements

    Duality for semiantichains and unichain coverings in products of special posets (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2009
    0 references
    A semiantichain in the product \(P\times Q\) of posets \(P\) and \(Q\) is a family in which elements may be incomparable or may be comparable if they differ in both coordinates, and a unichain is a chain that is constant in one coordinate. The main result of the paper is Theorem 2.3 stating that if \(P\) and \(Q\) are posets of width 2, then the maximum size of a semiantichain in \(P\times Q\) equals the minimum size of a unichain covering of \(P\times Q\). There are also some observations about the cases where both factors have height 2 or both factors have dimension 2.
    0 references
    semiantichains
    0 references
    unichains
    0 references
    unichain coverings
    0 references
    poset
    0 references
    products of posets
    0 references
    0 references

    Identifiers