Tight bounds for Katona's shadow intersection theorem

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)

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

zbMATH Keywords

Kruskal-Katona theoremKatona's shadow intersection theorem

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Extremal set theory (05D05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved bounds for Erdős' matching conjecture
• A new short proof of the EKR theorem
• On hypergraphs without two edges intersecting in a given number of vertices
• Extremal problems concerning Kneser-graphs
• On Sperner families in which no k sets have an empty intersection
• On maximal antichains containing no set and its complement
• Shadows and shifting
• Some best possible inequalities concerning cross-intersecting families
• Some intersection theorems
• On a conjecture on the Sperner property
• Resilient hypergraphs with fixed matching number
• The complete nontrivial-intersection theorem for systems of finite sets
• On shadows of intersecting families
• The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
• The structure of large intersecting families
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On Mubayi's Conjecture and Conditionally Intersecting Sets
• Intersection theorems for systems of finite sets
• On intersecting families of finite sets

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