Removal and Stability for Erdös--Ko--Rado
From MaRDI portal
Publication:2808164
DOI10.1137/15M105149XzbMath1336.05141arXiv1412.7885MaRDI QIDQ2808164
No author found.
Publication date: 26 May 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.7885
Related Items
Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ Structure and supersaturation for intersecting families ⋮ Sharp threshold for the Erdős–Ko–Rado theorem ⋮ Intersecting families of sets are typically trivial ⋮ Stability for vertex isoperimetry in the cube ⋮ Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability ⋮ On the random version of the Erdős matching conjecture ⋮ A structure theorem for almost low-degree functions on the slice ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ On stability of the independence number of a certain distance graph ⋮ Random Kneser graphs and hypergraphs ⋮ Kneser graphs are like Swiss cheese ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n, r, < s)\) ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Invitation to intersection problems for finite sets ⋮ Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
Cites Work
- Unnamed Item
- The minimum number of disjoint pairs in set systems and related problems
- Set systems without a simplex or a cluster
- On the stability of the Erdős-Ko-Rado theorem
- Shadows and intersections: Stability and new proofs
- On the measure of intersecting families, uniqueness and stability
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Boolean functions whose Fourier transform is concentrated on the first two levels.
- Intersecting families of discrete structures are typically trivial
- Most probably intersecting hypergraphs
- On “stability” in the Erdös--Ko--Rado Theorem
- Graph removal lemmas
- Most Probably Intersecting Families of Subsets
- Compressions and Probably Intersecting Families
- Friedgut--Kalai--Naor theorem for slices of the Boolean cube
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
- Erdős–Ko–Rado in Random Hypergraphs
- Intersecting Families are Essentially Contained in Juntas
- On the Shannon capacity of a graph
- Probably Intersecting Families are Not Nested
- On Erdős–Ko–Rado for Random Hypergraphs II
- On Erdős–Ko–Rado for random hypergraphs I
- Erdős–Ko–Rado for Random Hypergraphs: Asymptotics and Stability
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
