Interval Packing and Covering in the Boolean Lattice (Q2785370): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Coverings of the complete (di-)graph with n vertices by complete bipartite (di-)graphs with n vertices. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval stability and interval covering property in finite posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructions of ranked posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Hashing and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ratio of optimal integral and fractional covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for two set systems with prescribed intersections / rank
 
Normal rank

Revision as of 10:48, 27 May 2024

scientific article
Language Label Description Also known as
English
Interval Packing and Covering in the Boolean Lattice
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references