Random walks and multiply intersecting families
Let \(n,r\) and \(t\) be positive integers. A family \({\mathcal F}\) of subsets of \(\{1,2,\ldots ,n\}\) is called \(r\)-wise \(t\)-intersecting if \(| F_{1}\cap \cdots \cap F_{r}| \geq t\) holds for all \(F_{1},\dots ,F_{r}\in {\mathcal F}\). In this paper it is shown that if such a family \({\mathcal F}\) is a 3-wise 2-intersecting Sperner family then \(| {\mathcal F}| \) is less than or equal to \({n-2}\choose{(n-2)/2}\) if \(n\) is even and to \({{n-2}\choose{(n-1)/2}}+2\) if \(n\) is odd for \(n\geq n_{0}\). The unique extremal configuration is determined as well.
- A Combinatorial Theorem on Systems of Sets
- scientific article; zbMATH DE number 4029608 (Why is no real title available?)
- scientific article; zbMATH DE number 3710176 (Why is no real title available?)
- scientific article; zbMATH DE number 3489128 (Why is no real title available?)
- scientific article; zbMATH DE number 3189757 (Why is no real title available?)
- Intersection theorems for systems of finite sets
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On Sperner families in which no k sets have an empty intersection
- On Sperner families in which no k sets have an empty intersection. II
- On Sperner families in which no k sets have an empty intersection. III
- On Sperner families satisfying an additional condition
- The complete intersection theorem for systems of finite sets
- Weighted 3-wise 2-intersecting families
- Weighted multiply intersecting families
- Weighted non-trivial multiply intersecting families
- Multiply intersecting families of sets
- Weighted 3-wise 2-intersecting families
- Incompatible intersection properties
- Multiply-intersecting families revisited
- The maximum size of 4-wise 2-intersecting and 4-wise 2-union families
- The maximum size of 3-wise intersecting and 3-wise union families
- An extension of the Erdős–Ko–Rado Theorem
- The random walk method for intersecting families
- Nearly extremal non-trivial cross t-intersecting families and r-wise t-intersecting families
- The maximum size of intersecting and union families of sets
- EKR type inequalities for 4-wise intersecting families
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case
This page was built for publication: Random walks and multiply intersecting families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1763876)
