Shadows and intersections: Stability and new proofs

By Peter Keevash. 2008

78 citations recorded by the source corpus.

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.

Subfields: Discrete Mathematics and Combinatorics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/216d98a2f1e7af9cc185cc3c849eb73b34d5599a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Discrete Mathematics and Combinatorics

  1. Nathan Keller
  2. Yoshiharu Kohayakawa
  3. Jie Han
  4. Noam Lifshitz
  5. David Ellis

In Geometry and Topology

  1. Yoshiharu Kohayakawa
  2. Jie Han
  3. Dhruv Mubayi
  4. Alexandr V. Kostochka

Citations in the corpus