Stability versions of Erdős-Ko-Rado type theorems via isoperimetry

DOI10.4171/JEMS/915zbMath1429.05198arXiv1604.02160MaRDI QIDQ2279508

Noam Lifshitz, David Ellis, Nathan Keller

Publication date: 12 December 2019

Published in: Journal of the European Mathematical Society (JEMS) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02160

zbMATH Keywords

Erdős-Ko-Rado theoremisoperimetrydiscrete Fourier analysiscross-intersecting familiesAhlswede-Khachatrian theoremErdős matching conjecturestability version

Mathematics Subject Classification ID

Extremal set theory (05D05) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (20)

On Ramsey numbers for arbitrary sequences of graphs ⋮ Sharp bounds for the chromatic number of random Kneser graphs ⋮ \(K_4\)-intersecting families of graphs ⋮ Forbidden intersections for codes ⋮ Strong stability of 3-wise \(t\)-intersecting families ⋮ Stability for vertex isoperimetry in the cube ⋮ The maximum measure of 3-wise \(t\)-intersecting families ⋮ On a biased edge isoperimetric inequality for the discrete cube ⋮ A structure theorem for almost low-degree functions on the slice ⋮ A Note on Large H-Intersecting Families ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture ⋮ On symmetric intersecting families ⋮ On set systems without a simplex-cluster and the junta method ⋮ Hypergraph Removal Lemmas via Robust Sharp Threshold Theorems ⋮ Invitation to intersection problems for finite sets ⋮ On the union of intersecting families ⋮ Two problems on matchings in set families -- in the footsteps of Erdős and Kleitman ⋮ Nearly Perfect Matchings in Uniform Hypergraphs ⋮ Degree versions of theorems on intersecting families via stability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families
• Set systems without a simplex or a cluster
• A product version of the Erdős-Ko-Rado theorem
• Stability analysis for \(k\)-wise intersecting families
• The complete intersection theorem for systems of finite sets
• The exact bound in the Erdős-Ko-Rado theorem
• On the hardness of approximating minimum vertex cover
• Proof of an intersection theorem via graph homomorphisms
• Pairwise intersections and forbidden configurations
• On the stability of the Erdős-Ko-Rado theorem
• Shadows and intersections: Stability and new proofs
• A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
• On the measure of intersecting families, uniqueness and stability
• Erdős-Ko-Rado theorem with conditions on the maximal degree
• A note on the edges of the n-cube
• Contributions to the geometry of Hamming spaces
• On Russo's approximate zero-one law
• On a biased edge isoperimetric inequality for the discrete cube
• Boolean functions whose Fourier transform is concentrated on the first two levels.
• The complete nontrivial-intersection theorem for systems of finite sets
• Triangle-intersecting families of graphs
• A new short proof of a theorem of Ahlswede and Khachatrian
• On “stability” in the Erdös--Ko--Rado Theorem
• Cross t-Intersecting Integer Sequences from Weighted Erdős–Ko–Rado
• The Size of a Hypergraph and its Matching Number
• FKN Theorem on the biased cube
• A survey of Turán problems for expansions
• The structure of large intersecting families
• Almost Isoperimetric Subsets of the Discrete Cube
• Erdös–Ko–Rado Theorem—22 Years Later
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Structure and stability of triangle-free set systems
• Thresholds and Expectation Thresholds
• TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM
• Intersecting Families are Essentially Contained in Juntas
• Probabilities for Intersecting Systems and Random Subsets of Finite Sets
• An approximate zero-one law
• SETS OF INDEPENDENT EDGES OF A HYPERGRAPH
• Intersection Properties of Systems of Finite Sets
• Sharp thresholds of graph properties, and the $k$-sat problem
• Assignment of Numbers to Vertices
• Weighted multiply intersecting families
• Intersection theorems for systems of finite sets
• Set Systems with No Singleton Intersection
• Maximally Connected Arrays on the n-Cube
• SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Stability versions of Erdős-Ko-Rado type theorems via isoperimetry