On the Erdos-Ko-Rado Theorem and the Bollobas Theorem for t-intersecting families

preprint2014arXivOpen access

Abstract

A family F\mathcal{F} is tt-intersecting\it{intersecting} if any two members have at least tt common elements. Erd\H os, Ko, and Rado proved that the maximum size of a tt-intersecting family of subsets of size kk is equal to (n−tk−t) {{n-t} \choose {k-t}} if n≥n0(k,t)n\geq n_0(k,t). 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 tt-intersecting families for all t≥1t \geq 1. In 2004, Talbot generalized Bollobás's Two Families Theorem to tt-intersecting families. In this paper, we proved a slight generalization of Talbot's result by using the probabilistic method.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.