Published July 27, 2023 | Version public
Journal Article

A Local Version of Katona's Intersecting Shadow Theorem

  • 1. ROR icon Emory University
  • 2. ROR icon California Institute of Technology

Abstract

Katona's intersection theorem states that every intersecting family F ⊆ [n]ᵏ satisfies |∂F| ⩾ |F|, where ∂F = {F\ {x} : x ϵ F ϵ F} is the shadow of F. Frankl conjectured that for n > 2k and every intersecting family F ⊆ [n]^⁽ᵏ⁾, there is some i ∈ [n] such that |∂F(i)| ⩾ |F(i)|, where F(i)={F∖ {i} : i ∈ F ∈ F} is the link of F at i. Here, we prove this conjecture in a very strong form for n > (^(k+1)_(2)). In particular, our result implies that for any j ∈ [k], there is a j-set {a₁, . . . , a_j} ∈ [n]⁽ʲ⁾ such that |∂F(a₁, . . . , a_j)| ⩾ |F(a₁, . . . , a_j)|. A similar statement is also obtained for cross-intersecting families.

Additional Information

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law. The authors thank Alexandre Perozim de Faveri for fruitful discussions and Peter Frankl and Andrey Kupavskii for reading earlier versions of this paper. Further, we thank the referees for their careful reading and suggestions that led to an improved presentation.

Additional details

Identifiers

Eprint ID
122148
Resolver ID
CaltechAUTHORS:20230705-476466000.12

Dates

Created
2023-07-27
Created from EPrint's datestamp field
Updated
2023-07-27
Created from EPrint's last_modified field