On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
On the Erdős-Ko-Rado theorem and the Bollobás theorem for t-intersecting families
复制标题
关于 t 相交族的 Erdős-Ko-Rado 定理和 Bollobás 定理
DOI:
10.1016/j.ejc.2015.01.009
复制
发表时间:
2014
期刊:
影响因子:
--
通讯作者:
Younjin Kim
中科院分区:
文献类型:
--
作者:
D. Kang;Jaehoon Kim;Younjin Kim
A family F is t-intersecting if any two members have at least t common elements. Erdős, Ko and Rado (1961) proved that the maximum size of a t-intersecting family of subsets of size k is equal to n− t k− t if n≥ n 0 (k, t). Alon, Aydinian and Huang (2014) considered families generalizing intersecting families, and proved the same bound. In this paper, we give a strengthening of their result by considering families generalizing t-intersecting families for all t≥ 1. In 2004, Talbot generalized Bollobás’s Two Families Theorem (Bollobás, 1965) to t-intersecting families. In this paper, we proved a slight generalization of Talbot’s result by using the probabilistic method.