go-v.orgdoi

The Intersection Structure of $t$-Intersecting Families

John Talbot · The Electronic Journal of Combinatorics · 2005

  • DOI 10.37236/1985
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2005

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2005

Abstract

A family of sets is $t$-intersecting if any two sets from the family contain at least $t$ common elements. Given a $t$-intersecting family of $r$-sets from an $n$-set, how many distinct sets of size $k$ can occur as pairwise intersections of its members? We prove an asymptotic upper bound on this number that can always be achieved. This result can be seen as a generalization of the Erdős-Ko-Rado theorem.

Open the resolved locator · 10.37236/1985

Metadata licence: OpenAlex metadata (CC0)