Two easy duality theorems for product partial orders (Q580378): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A decomposition theorem for partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and the greedy algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5514188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / 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: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Dilworth's decomposition theorem for 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

Latest revision as of 11:19, 18 June 2024

scientific article
Language Label Description Also known as
English
Two easy duality theorems for product partial orders
scientific article

    Statements

    Two easy duality theorems for product partial orders (English)
    0 references
    0 references
    0 references
    1987
    0 references
    Two duality theorems are proved about the direct product of two partial orders. Theorem 1. The largest unichain in a direct product of posets has the same size as the smallest covering by semiantichains. Theorem 2. The largest uniantichain in a direct product of posets has the same size as the smallest covering by semichains.
    0 references
    duality theorems
    0 references
    partial orders
    0 references
    largest unichain
    0 references
    direct product of posets
    0 references
    covering by semiantichains
    0 references

    Identifiers