A simple removal lemma for large nearly-intersecting families
From MaRDI portal
Publication:322197
DOI10.1016/J.ENDM.2015.06.015zbMATH Open1346.05130OpenAlexW2176019676WikidataQ124935600 ScholiaQ124935600MaRDI QIDQ322197FDOQ322197
Authors: Tuan Anh Tran, Shagnik Das 
Publication date: 14 October 2016
Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.015
Recommendations
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the Shannon capacity of a graph
- Transference for the Erdős-Ko-Rado theorem
- Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
- On the stability of the Erdős-Ko-Rado theorem
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Erdős-Ko-Rado theorem with conditions on the maximal degree
- Intersecting families of discrete structures are typically trivial
- Most probably intersecting hypergraphs
- Most probably intersecting families of subsets
- Compressions and probably intersecting families
- Friedgut-Kalai-Naor theorem for slices of the Boolean cube
- A simple removal lemma for large nearly-intersecting families
- Erdős-Ko-Rado in random hypergraphs
- Intersecting Families are Essentially Contained in Juntas
- Probably intersecting families are not nested
- On Erdős-Ko-Rado for random hypergraphs. II
- On Erdős-Ko-Rado for random hypergraphs. I
- The minimum number of disjoint pairs in set systems and related problems
- Set systems without a simplex or a cluster
- Shadows and intersections: Stability and new proofs
- On the measure of intersecting families, uniqueness and stability
Cited In (11)
- On stability of the independence number of a certain distance graph
- On ``stability in the Erdős-Ko-Rado theorem
- On the stability of some Erdős-Ko-Rado type results
- Removal and stability for Erdős-Ko-Rado
- Chromatic number of random Kneser hypergraphs
- On threshold probability for the stability of independent sets in distance graphs
- On the chromatic number of random subgraphs of a certain distance graph
- Transference for the Erdős-Ko-Rado theorem
- A simple removal lemma for large nearly-intersecting families
- A removal lemma for linear configurations in subsets of the circle
- Kneser graphs are like Swiss cheese
This page was built for publication: A simple removal lemma for large nearly-intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q322197)
