English

Intersection theorems for uniform subfamilies of hereditary families

Combinatorics 2023-11-07 v1

Abstract

A family C\mathcal C of sets is hereditary if whenever ACA\in \mathcal C and BAB\subset A, we have BCB\in \mathcal 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 Erd\H{o}s-Ko-Rado theorem. A natural uniform variant of this question, which is essentially a generalization for the uniform Erd\H{o}s-Ko-Rado theorem, was suggested by Borg: given a hereditary family C\mathcal C, in which all maximal sets have size at least nn, what is the largest intersecting subfamily of the family of all kk-element sets in C\mathcal C? The answer, of course, depends on nn and kk, and Borg conjectured that for n2kn\ge 2k the it is again the family of all kk-element sets containing a singleton. Borg proved this conjecture for nk3n\ge k^3. He also considered a tt-intersecting variant of the question. In this paper, we improve the bound on nn for both intersecting and tt-intersecting cases, showing that for nCktlog2nkn\ge Ckt\log^2\frac nk and nCklogkn\ge Ck\log k the largest tt-intersecting subfamily of the kk-th layer of a hereditary family with maximal sets of size at least nn is the family of all sets containing a fixed tt-element set. We also prove a stability result.

Keywords

Cite

@article{arxiv.2311.02246,
  title  = {Intersection theorems for uniform subfamilies of hereditary families},
  author = {Andrey Kupavskii},
  journal= {arXiv preprint arXiv:2311.02246},
  year   = {2023}
}