A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families (Q785827): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4745752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of two others / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of finite sets in which no set is covered by the union of \(r\) others / rank
 
Normal rank
Property / cites work
 
Property / cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound of the size of the \(r\)-cover-free families / rank
 
Normal rank

Revision as of 07:00, 23 July 2024

scientific article
Language Label Description Also known as
English
A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families
scientific article

    Statements

    A probabilistic variant of Sperner's theorem and of maximal \(r\)-cover free families (English)
    0 references
    0 references
    0 references
    0 references
    12 August 2020
    0 references
    cover free families
    0 references
    Sperner's theorem
    0 references

    Identifiers