Intersection theorems for uniform subfamilies of hereditary families

Abstract

A family C of sets is hereditary if whenever A∈ C and B⊂ A, we have B∈ C. Chv\'atal conjectured that the largest intersecting subfamily of a hereditary family is the family of all sets containing a fixed element. This is a generalization of the non-uniform Erdos-Ko-Rado theorem. A natural uniform variant of this question, which is essentially a generalization for the uniform Erdos-Ko-Rado theorem, was suggested by Borg: given a hereditary family C, in which all maximal sets have size at least n, what is the largest intersecting subfamily of the family of all k-element sets in C? The answer, of course, depends on n and k, and Borg conjectured that for n 2k the it is again the family of all k-element sets containing a singleton. Borg proved this conjecture for n k3. He also considered a t-intersecting variant of the question. In this paper, we improve the bound on n for both intersecting and t-intersecting cases, showing that for n Ckt2 nk and n Ck k the largest t-intersecting subfamily of the k-th layer of a hereditary family with maximal sets of size at least n is the family of all sets containing a fixed t-element set. We also prove a stability result.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…