Intersecting non-uniform families containing subfamilies

MaRDI QIDQ6295804zbMATH OpenFDO

Authors Carl Feghali

Publication date 28 December 2017

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: A family of sets is said to be intersecting if every pair of sets in the family have non-empty intersection. In this paper, we initiate the study of intersecting non-uniform families of sets of one of two sizes containing given subfamilies. For a set $X$ and integer $r$, let $$ denote the family $AsubseteqX:|X|=r$. Let $a$, $b$, and $n$ be positive integers such that $a<b$. We determine the maximum size of an intersecting family in $$ whenever $n>b$. For $n$ sufficiently large, we also determine the maximum size of an intersecting family in $$ whenever $3n>2b$ and $b>a+2$. Our results are, in some sense, best possible. Our methods include the use of Katona's shadow intersection theorem and a recent diversity theorem of Kupavskii and~Zakharov.

This page was built for publication: Intersecting non-uniform families containing subfamilies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6295804)