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

Erdős-Ko-Rado (EKR) type theorems yield upper bounds on the sizes of families of sets, subject to various intersection requirements on the sets in the family. Stability versions of such theorems assert that if the size of a family is close to the maximum possible size, then the family itself must be close (in some appropriate sense) to a maximum-sized family. In this paper, we present an approach to obtaining stability versions of EKR-type theorems, via isoperimetric inequalities for subsets of the hypercube. Our approach is rather general, and allows the leveraging of a wide variety of exact EKR-type results into strong stability versions of these results, without going into the proofs of the original results. We use this approach to obtain tight stability versions of the EKR theorem itself and of the Ahlswede-Khachatrian theorem on $t$-intersecting families of $k$-element subsets of $\{1,2,\ldots.n\}$ (for $k < \frac{n}{t+1}$), and to show that, somewhat surprisingly, all these results hold when the intersection requirement is replaced by a much weaker requirement. Other examples include stability versions of Frankl's recent result on the Erdős matching conjecture, the Ellis-Filmus-Friedgut proof of the Simonovits-Sos conjecture, and various EKR-type results on $r$-wise (cross)-$t$-intersecting families.

[1]  Ehud Friedgut,et al.  Boolean Functions With Low Average Sensitivity Depend On Few Coordinates , 1998, Comb..

[2]  W. Beckner.  Inequalities in Fourier analysis , 1975 .

[3]  Irit Dinur,et al.  Intersecting Families are Essentially Contained in Juntas , 2009, Combinatorics, Probability and Computing.

[4]  Assaf Naor,et al.  Boolean functions whose Fourier transform is concentrated on the first two levels , 2002, Adv. Appl. Math..

[5]  M. Talagrand.  On Russo's Approximate Zero-One Law , 1994 .

[6]  Peter Keevash,et al.  Shadows and intersections: Stability and new proofs , 2008, 0806.2023.

[7]  Richard M. Wilson,et al.  The exact bound in the Erdös-Ko-Rado theorem , 1984, Comb..

[8]  Norihide Tokushige.  A product version of the Erdős-Ko-Rado theorem , 2011, J. Comb. Theory, Ser. A.

[9]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

[10]  L. H. Harper.  Optimal Assignments of Numbers to Vertices , 1964 .

[11]  Peter Frankl,et al.  Erdös–Ko–Rado Theorem—22 Years Later , 1983 .

[12]  Sergiu Hart,et al.  A note on the edges of the n-cube , 1976, Discret. Math..

[13]  Peter Frankl,et al.  Erdös-Ko-Rado theorem with conditions on the maximal degree , 1987, J. Comb. Theory, Ser. A.

[14]  G. Kalai,et al.  Every monotone graph property has a sharp threshold , 1996 .

[15]  Ehud Friedgut,et al.  On the measure of intersecting families, uniqueness and stability , 2008, Comb..

[16]  A. J. W. Hilton,et al.  SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1967 .

[17]  A. J. Bernstein,et al.  Maximally Connected Arrays on the n-Cube , 1967 .

[18]  David Ellis.  Almost Isoperimetric Subsets of the Discrete Cube , 2011, Comb. Probab. Comput..

[19]  D. E. Daykin,et al.  SETS OF INDEPENDENT EDGES OF A HYPERGRAPH , 1976 .

[20]  Dhruv Mubayi,et al.  Set Systems with No Singleton Intersection , 2006, SIAM J. Discret. Math..

[21]  Béla Bollobás,et al.  TRANSFERENCE FOR THE ERDŐS–KO–RADO THEOREM , 2015, Forum of Mathematics, Sigma.

[22]  D. Mubayi.  Structure and stability of triangle-free set systems , 2006 .

[23]  Richard P. Anstee,et al.  Pairwise intersections and forbidden configurations , 2006 .

[24]  P. Erdös,et al.  INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS , 1961 .

[25]  Peter Frankl,et al.  Improved bounds for Erd ˝ os' Matching Conjecture , 2013 .

[26]  David Ellis,et al.  On a biased edge isoperimetric inequality for the discrete cube , 2019, J. Comb. Theory, Ser. A.

[27]  Peter Frankl,et al.  Improved bounds for Erdős' Matching Conjecture , 2013, J. Comb. Theory, Ser. A.

[28]  Rudolf Ahlswede,et al.  Contributions to the geometry of hamming spaces , 1977, Discret. Math..

[29]  S. Safra,et al.  Noise-Resistant Boolean-Functions are Juntas , 2003 .

[30]  Norihide Tokushige.  Cross t-Intersecting Integer Sequences from Weighted Erdős-Ko-Rado , 2013, Comb. Probab. Comput..

[31]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[32]  Hao Huang,et al.  The Size of a Hypergraph and its Matching Number , 2011, Combinatorics, Probability and Computing.

[33]  P. Erdos.  A PROBLEM ON INDEPENDENT r-TUPLES , 1965 .

[34]  G. Katona.  A theorem of finite sets , 2009 .

[35]  Béla Bollobás,et al.  On the stability of the Erdős-Ko-Rado theorem , 2016, J. Comb. Theory, Ser. A.

[36]  Norihide Tokushige,et al.  Weighted multiply intersecting families , 2003 .

[37]  Nathan Keller.  A simple reduction from a biased measure on the discrete cube to the uniform measure , 2012, Eur. J. Comb..

[38]  Jeff Kahn,et al.  Thresholds and Expectation Thresholds , 2007, Comb. Probab. Comput..

[39]  Nathan Keller,et al.  A tight stability version of the Complete Intersection Theorem , 2016 .

[40]  Rudolf Ahlswede,et al.  The Complete Intersection Theorem for Systems of Finite Sets , 1997, Eur. J. Comb..

[41]  D. Mubayi,et al.  A survey of Tur\'an problems for expansions , 2015, 1505.08078.

[42]  Yuval Filmus,et al.  Triangle-intersecting Families of Graphs , 2010 .

[43]  Vikram Kamat.  Stability Analysis for k-wise Intersecting Families , 2011, Electron. J. Comb..

[44]  Rudolf Ahlswede,et al.  The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets , 1996, J. Comb. Theory, Ser. A.

[45]  Jeffrey C. Lagarias,et al.  Probabilities for intersecting systems and random subsets of finite sets , 1986 .

[46]  Paul Erdös,et al.  INTERSECTION PROPERTIES OF SYSTEMS OF FINITE SETS , 1978 .

[47]  Dhruv Mubayi,et al.  Set systems without a simplex or a cluster , 2010, Comb..

[48]  Dhruv Mubayi,et al.  The structure of large intersecting families , 2016 .

[49]  Sangjune Lee,et al.  An Erdős-Ko-Rado theorem for cross t-intersecting families , 2014, J. Comb. Theory, Ser. A.

[50]  L. Russo.  An approximate zero-one law , 1982 .

[51]  J. Kahn,et al.  On "stability" in the Erd\H{o}s-Ko-Rado theorem , 2015, 1502.05692.

[52]  Norihide Tokushige.  A multiply intersecting Erdos-Ko-Rado theorem - The principal case , 2010, Discret. Math..

[53]  B. Bollobás.  Combinatorics: Set Systems, Hypergraphs, Families of Vectors and Combinatorial Probability , 1986 .

[54]  Vojtech Rödl,et al.  On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size , 2012, Combinatorics, Probability and Computing.

[55]  Piotr Nayar,et al.  FKN Theorem on the biased cube , 2013, 1311.3179.

[56]  József Balogh,et al.  A new short proof of a theorem of Ahlswede and Khachatrian , 2008, J. Comb. Theory, Ser. A.

[57]  Irit Dinur,et al.  Proof of an Intersection Theorem via Graph Homomorphisms , 2006, Electron. J. Comb..

[58]  John H. Lindsey,et al.  Assignment of Numbers to Vertices , 1964 .