A preliminary result for generalized intersecting families

MaRDI QIDQ6357652zbMATH OpenFDO

Authors Brian T. Chan

Publication date 5 January 2021

Mathematics Subject Classification ID

Extremal set theory (05D05)

Abstract: Intersecting families and blocking sets feature prominently in extremal combinatorics. We examine the following generalization of an intersecting family investigated by Hajnal, Rothschild, and others. If $sgeq1$, $kgeq2$, and $ugeq1$ are integers, then say that an $s$-uniform family $mathcalF$ is $(k,u)$-intersecting if for all $A_1,A_2,cdots,A_{k}inmathcalF$, $|A_{i}cap{A}_j|gequ$ for some $1leqi<jleqk$. In this note, we investigate the following parameter. If $s$, $k$, $u$, $ell$ are integers satisfying $sgeq1$, $kgeq2$, $1lequleqs$, and $2leqell<k$, then let $N_{k,ell}^{(u)}(s)$ denote the smallest integer $r$, if it exists, such that any $(k,u)$-intersecting $s$-uniform family is the union of at most $r$ families that are $(ell,u)$-intersecting. Using a Sunflower Lemma type argument, we prove that $N_{k,ell}^{(u)}(s)$ always exists and that the following inequality always holds: ${\displaystyle }$N^{(u)}_{k,ell}(s) ; leq ; �igg{lceil} dfrac{ k - 1 }{ell - 1} cdot {s choose u} �igg{ ceil}${\displaystyle }$

This page was built for publication: A preliminary result for generalized intersecting families

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