Andrés Eduardo Caicedo

Learn More
We show that if X is a set and A ⊆ [X] n is non-empty and contains at most k pairwise disjoint elements, then a non-empty subset of X of cardi-nality strictly less than kn 2 is definable from A. We show that this result is nearly best possible. We also study bounds on the size of intersecting families of (≤ n)-element subsets from which no smaller such(More)
  • 1