English

Using the existence of t-designs to prove Erd\H{o}s-Ko-Rado

Combinatorics 2018-02-13 v1

Abstract

In 1984, Wilson proved the Erd\H{o}s-Ko-Rado theorem for tt-intersecting families of kk-subsets of an nn-set: he showed that if n(t+1)(kt+1)n\ge(t+1)(k-t+1) and F\mathcal{F} is a family of kk-subsets of an nn-set such that any two members of F\mathcal{F} have at least tt elements in common, then F(ntkt)|\mathcal{F}|\le\binom{n-t}{k-t}. His proof made essential use of a matrix whose origin is not obvious. In this paper we show that this matrix can be derived, in a sense, as a projection of tt-(n,k,1)(n,k,1) design.

Keywords

Cite

@article{arxiv.1802.03444,
  title  = {Using the existence of t-designs to prove Erd\H{o}s-Ko-Rado},
  author = {Chris Godsil and Krystal Guo},
  journal= {arXiv preprint arXiv:1802.03444},
  year   = {2018}
}

Comments

6 pages