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 , , and are integers, then say that an -uniform family is -intersecting if for all , for some . In this note, we investigate the following parameter. If , , , are integers satisfying , , , and , then let denote the smallest integer , if it exists, such that any -intersecting -uniform family is the union of at most families that are -intersecting. Using a Sunflower Lemma type argument, we prove that always exists and that the following inequality always holds: $$N^{(u)}_{k,\ell}(s) \; \leq \; \bigg{\lceil} \dfrac{ k - 1 }{\ell - 1} \cdot {s \choose u} \bigg{\rceil}$$
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.