A simple removal lemma for large nearly-intersecting families

DOI10.1016/J.ENDM.2015.06.015MaRDI QIDQ322197zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

intersecting familiesremoval lemmaErdős-Ko-Rado theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• Removal and stability for Erdős-Ko-Rado
• Transference for the Erdős-Ko-Rado theorem
• Sharp threshold for the Erdős–Ko–Rado theorem
• On the stability of some Erdős-Ko-Rado type results
• On the stability of the Erdős-Ko-Rado theorem

Cites work

• A simple removal lemma for large nearly-intersecting families
• Compressions and probably intersecting families
• Erdős-Ko-Rado for random hypergraphs: asymptotics and stability
• Erdős-Ko-Rado in random hypergraphs
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• Friedgut-Kalai-Naor theorem for slices of the Boolean cube
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Intersecting Families are Essentially Contained in Juntas
• Intersecting families of discrete structures are typically trivial
• Most probably intersecting families of subsets
• Most probably intersecting hypergraphs
• On Erdős-Ko-Rado for random hypergraphs. I
• On Erdős-Ko-Rado for random hypergraphs. II
• On the Shannon capacity of a graph
• On the measure of intersecting families, uniqueness and stability
• On the stability of the Erdős-Ko-Rado theorem
• Probably intersecting families are not nested
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Set systems without a simplex or a cluster
• Shadows and intersections: Stability and new proofs
• The minimum number of disjoint pairs in set systems and related problems
• Transference for the Erdős-Ko-Rado theorem

Cited in

(11)

• On the stability of some Erdős-Ko-Rado type results
• On stability of the independence number of a certain distance graph
• On ``stability in the Erdős-Ko-Rado theorem
• 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)