Cutsets of Boolean lattices (Q1086269)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Cutsets of Boolean lattices
scientific article

    Statements

    Cutsets of Boolean lattices (English)
    0 references
    1987
    0 references
    If (P,\(\leq)\) is a finite ordered set and \(a\in P\), then \(F\subseteq P\) is a cutset for the element a, if (1) No element of F is comparable with a, (2) Every maximal chain of P intersects \(F\cup \{a\}\). In the article under review, the cardinalities of minimum sized cutsets associated with elements of finite Boolean algebras are determined.
    0 references
    finite ordered set
    0 references
    maximal chain
    0 references
    minimum sized cutsets
    0 references
    finite Boolean algebras
    0 references

    Identifiers