Shadows and intersections: stability and new proofs

dc.creatorKeevash, Peter
dc.date2008-06-12
dc.date.accessioned2026-07-07T09:44:09Z
dc.date.available2026-07-07T09:44:09Z
dc.descriptionWe give a short new proof of a version of the Kruskal-Katona theorem due to Lovász. 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 Lovász's theorem that answers a question of Frankl and Tokushige.
dc.description18 pages
dc.identifierhttps://arxiv.org/abs/0806.2023
dc.identifierhttp://arxiv.org/abs/0806.2023
dc.identifierAdv. Math. 218 (2008), 1685--1703
dc.identifierdoi:10.1016/j.aim.2008.03.023
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162770
dc.subjectCombinatorics
dc.subject05D05
dc.titleShadows and intersections: stability and new proofs
dc.typetext

Files

Collections