Size and structure of large (s,t)-union intersecting families [article]

Ali Taherkhani
2019 arXiv   pre-print
A family of sets is said to be intersecting if any two sets in have nonempty intersection. The celebrated Erdős-Ko-Rado theorem determines the size and structure of the largest intersecting family of k-sets on an n-set X. An (s,t)-union intersecting family is a family of k-sets on an n-set X such that for any A_1,...,A_s+t in this family, (∪_i=1^sA_i)∩(∪_i=1^t A_i+s)≠∅. Let ℓ() be the minimum number of sets in such that by removing them the resulting subfamily is intersecting. In this paper,
more » ... sufficiently large n, we characterize the size and structure of (s,t)-union intersecting families with maximum possible size and ℓ()≥ s+β. This allows us to find out the size and structure of some large and maximal (s,t)-union intersecting families. Our results are nontrivial extensions of some recent generalizations of the Erdős-Ko-Rado theorem such as the Han and Kohayakawa theorem 2017 which finds the structure of the third largest intersecting family, the Kostochka and Mubayi theorem 2017, and the more recent Kupavskii's theorem 2018 whose both results determine the size and structure of the ith largest intersecting family of k-sets for i≤ k+1. In particular, we prove that a Hilton-Milner-type stability theorem holds for (1,t)-union intersecting families, that indeed, confirms a conjecture of Alishahi and Taherkhani 2018. We extend our results to K_s_1,...,s_r+1-free subgraphs of Kneser graphs. In fact, when n is sufficiently large, we characterize the size and structure of large and maximal K_s_1,...,s_r+1-free subgraphs of Kneser graphs. In particular, when s_1=...=s_r+1=1 our result provides some stability results related to the famous Erdős matching conjecture.
arXiv:1903.02614v3 fatcat:eso6mul4wzg4xkd752o6oyvvvu