Supersaturation and stability for forbidden subposet problems. (Q490923): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Simple hypergraphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with maximal number of adjacent pairs of edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Families With a Forbidden Induced Subposet / rank
 
Normal rank
Property / cites work
 
Property / cites work: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems with few disjoint pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set families with a forbidden subposet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum number of disjoint pairs in set systems and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner's Theorem and a Problem of Erdős, Katona and Kleitman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest family without \(A \cup B \subseteq C \cap D\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersaturation in the Boolean lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4338928 / 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: On a theorem of Rademacher-Turán / 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: Supersaturated graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum number of disjoint pairs in a family of finite sets / 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: On a problem of Kleitman and West / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4458414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4071752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3315539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5542810 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193510 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5726070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880849 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of Sperner's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of Sperner’s Theorem on the Number of Subsets of a Finite Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden Hypermatrices Imply General Bounds on Induced Forbidden Subposet Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logarithmic order of free distributive lattice / rank
 
Normal rank

Latest revision as of 15:57, 10 July 2024

scientific article
Language Label Description Also known as
English
Supersaturation and stability for forbidden subposet problems.
scientific article

    Statements

    Supersaturation and stability for forbidden subposet problems. (English)
    0 references
    0 references
    21 August 2015
    0 references
    forbidden subposets
    0 references
    supersaturation
    0 references
    stability
    0 references
    numbers of butterflies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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