The saturation number of induced subposets of the Boolean lattice (Q2012537): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Berge trigraphs / 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: A Problem in Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of minimum saturated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite dimensions and bipartite degrees of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saturating Sperner families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progress on poset-free families of subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced saturation number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4846548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On saturated \(k\)-Sperner systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3279628 / rank
 
Normal rank

Latest revision as of 05:32, 14 July 2024

scientific article
Language Label Description Also known as
English
The saturation number of induced subposets of the Boolean lattice
scientific article

    Statements

    The saturation number of induced subposets of the Boolean lattice (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 August 2017
    0 references
    0 references
    posets
    0 references
    saturation
    0 references
    induced saturation
    0 references
    0 references
    0 references