Incomparable copies of a poset in the Boolean lattice. (Q890018): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set families with a forbidden subposet / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sperner theorem on unrelated chains of subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest families without an \(r\)-fork / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing posets in the Boolean lattice. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a lemma of Littlewood and Offord / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diamond-free families / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Families of Subsets With a Forbidden Subposet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diamond-free subposets of the Boolean lattice / rank
 
Normal rank

Latest revision as of 00:44, 11 July 2024

scientific article
Language Label Description Also known as
English
Incomparable copies of a poset in the Boolean lattice.
scientific article

    Statements

    Incomparable copies of a poset in the Boolean lattice. (English)
    0 references
    0 references
    0 references
    0 references
    9 November 2015
    0 references
    Sperner theorem
    0 references
    finite posets
    0 references
    incomparable copies
    0 references
    numbers of embeddings
    0 references

    Identifiers