Tight bounds for Katona's shadow intersection theorem

From MaRDI portal
Publication:2048364

DOI10.1016/J.EJC.2021.103391zbMath1469.05161arXiv2005.06999OpenAlexW3178101769MaRDI QIDQ2048364

Dhruv Mubayi, Xizhi Liu

Publication date: 5 August 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: A fundamental result in extremal set theory is Katona's shadow intersection theorem, which extends the Kruskal-Katona theorem by giving a lower bound on the size of the shadow of an intersecting family of k-sets in terms of its size. We improve this classical result and a related result of Ahlswede, Aydinian, and Khachatrian by proving tight bounds for families that can be quite small. For example, when k=3 our result is sharp for all families with n points and at least 3n7 triples. Katona's theorem was extended by Frankl to families with matching number s. We improve Frankl's result by giving tight bounds for large n.


Full work available at URL: https://arxiv.org/abs/2005.06999





Cites Work


Related Items (1)





This page was built for publication: Tight bounds for Katona's shadow intersection theorem