2018/05/01 by Matthew Fitch, Fitch, Matthew
Mathematics · #Advanced Algebra and Geometry #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1805.00340
openalex publication_date 2018/05/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The Kruskal Katona theorem was proved in the 1960s. In the theorem, we are given an integer r and families of sets A⊂ ℕ(r) and B⊂ℕ(r-1) such that for every A\inA, every subset of A of size r-1 is in B. We are interested in finding the mimimum size of b=|B| given fixed values of r and a=|A|. The Kruskal Katona theorem states that this mimimum occurs when both A and B are initial segments of the colexicographic ordering. The Kruskal Katona theorem is very useful and has had many applications and generalisations. In this paper, we are interested in one particular generalisation, where instead of every subset of A of size r-1 being in B, we will instead ask that only k of them are, where k is some integer smaller than r. Note that setting k=r is exactly the Kruskal Katona theorem. We will first find exact results for the cases where 0≤ k ≤ 3. For k≥ 4 we will not solve the question completely, however, we will find the exact result for infinitely many a. We will also provide a formula that is within some additive constant of the correct result for all a.