A simple removal lemma for large nearly-intersecting families (Q322197): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q124935600, #quickstatements; #temporary_batch_1711234560214
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2015.06.015 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Erdős–Ko–Rado in Random Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting families of discrete structures are typically trivial / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the stability of the Erdős-Ko-Rado theorem / 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: Most probably intersecting hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple removal lemma for large nearly-intersecting families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting Families are Essentially Contained in Juntas / 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: Friedgut--Kalai--Naor theorem for slices of the Boolean cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Ko-Rado theorem with conditions on the maximal degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the measure of intersecting families, uniqueness and stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Erdős–Ko–Rado for random hypergraphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Erdős–Ko–Rado for Random Hypergraphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Most Probably Intersecting Families of Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadows and intersections: Stability and new proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set systems without a simplex or a cluster / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressions and Probably Intersecting Families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probably Intersecting Families are Not Nested / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2015.06.015 / rank
 
Normal rank

Latest revision as of 14:20, 9 December 2024

scientific article
Language Label Description Also known as
English
A simple removal lemma for large nearly-intersecting families
scientific article

    Statements

    A simple removal lemma for large nearly-intersecting families (English)
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    Erdős-Ko-Rado theorem
    0 references
    intersecting families
    0 references
    removal lemma
    0 references

    Identifiers