Let ℱ be a t-wise s-intersecting family, i.e., |F1∩ ... ∩ Ft| ≥ s holds for every t members of ℱ. Then there exists a set Y such that |F1∩ ... ∩ Ft∩ Y| ≥ s still holds for every F1,..., Ft∈ℱ. Here exponential lower and upper bounds are proven for the possible sizes of Y.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics