A simple removal lemma for large nearly-intersecting families

DOI10.1016/j.endm.2015.06.015zbMath1346.05130OpenAlexW2176019676WikidataQ124935600 ScholiaQ124935600MaRDI QIDQ322197

Mohammad Hasan, M. Dambrine

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.015

zbMATH Keywords

Erdős-Ko-Rado theoremintersecting familiesremoval lemma

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (7)

A simple removal lemma for large nearly-intersecting families ⋮ Chromatic number of random Kneser hypergraphs ⋮ On stability of the independence number of a certain distance graph ⋮ On the stability of some Erdős-Ko-Rado type results ⋮ On threshold probability for the stability of independent sets in distance graphs ⋮ On “stability” in the Erdös--Ko--Rado Theorem ⋮ On the chromatic number of random subgraphs of a certain distance graph

Cites Work

• A simple removal lemma for large nearly-intersecting families
• 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
• 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
• 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

This page was built for publication: A simple removal lemma for large nearly-intersecting families