Shadows and intersections: Stability and new proofs

Abstract We give a short new proof of a version of the Kruskal–Katona theorem due to Lovasz. Our method can be extended to a stability result, describing the approximate structure of configurations that are close to being extremal, which answers a question of Mubayi. This in turn leads to another combinatorial proof of a stability theorem for intersecting families, which was originally obtained by Friedgut using spectral techniques and then sharpened by Keevash and Mubayi by means of a purely combinatorial result of Frankl. We also give an algebraic perspective on these problems, giving yet another proof of intersection stability that relies on expansion of a certain Cayley graph of the symmetric group, and an algebraic generalisation of Lovasz's theorem that answers a question of Frankl and Tokushige.

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

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

[3]  David E. Daykin,et al.  A Simple Proof of the Kruskal-Katona Theorem , 1974, J. Comb. Theory, Ser. A.

[4]  Béla Bollobás,et al.  Threshold functions , 1987, Comb..

[5]  D. Gottlieb.  A certain class of incidence matrices , 1966 .

[6]  P. Frankl,et al.  Linear Algebra Methods in Combinatorics I , 1988 .

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

[8]  J. Kahn,et al.  On the number of copies of one hypergraph in another , 1998 .

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

[10]  Pavel Pudlák,et al.  A note on the use of determinant for proving lower bounds on the size of linear circuits , 2000, Inf. Process. Lett..

[11]  A. Razborov,et al.  Improved lower bounds on the rigidity of Hadamard matrices , 1998 .

[12]  Martin Kassabov.  Symmetric Groups and Expanders , 2005 .

[13]  David E. Daykin.  Erdös-Ko-Rado from Kruskal-Katona , 1974, J. Comb. Theory, Ser. A.

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

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

[16]  R. Bacher.  Minimal Eigenvalue of the Coxeter Laplacian for the Symmetrical Group , 1994 .

[17]  A. J. W. Hilton.  A simple proof of the Kruskal-Katona theorem and of some associated binomial inequalities , 1979 .

[18]  L. Lovász.  Combinatorial problems and exercises , 1979 .

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

[20]  R. Bellman.  Mathematical optimization techniques , 1964 .

[21]  Satyanarayana V. Lokam.  Spectral Methods for Matrix Rigidity with Applications to Size-Depth Trade-offs and Communication Complexity , 2001, J. Comput. Syst. Sci..

[22]  Benny Sudakov,et al.  Set Systems with Restricted Cross-Intersections and the Minimum Rank of Inclusion Matrices , 2005, SIAM J. Discret. Math..

[23]  M. A. Perles.  ON THE NUMBER OF SUBGRAPHS OF PRESCRIBED TYPE OF GRAPHS WITH A GIVEN NUMBER OF EDGES* , 2007 .

[24]  Peter Frankl,et al.  A new short proof for the Kruskal-Katona theorem , 1984, Discret. Math..

[25]  N. Alon,et al.  The Probabilistic Method, Second Edition , 2000 .