Abstract
A family is - if any two members have at least common elements. Erd\H os, Ko, and Rado proved that the maximum size of a -intersecting family of subsets of size is equal to if . Alon, Aydinian, and Huang considered families generalizing intersecting families, and proved the same bound. In this paper, we give a strengthening of their result by considering families generalizing -intersecting families for all . In 2004, Talbot generalized Bollobás's Two Families Theorem to -intersecting families. In this paper, we proved a slight generalization of Talbot's result by using the probabilistic method.
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.