Frankl-Rödl type theorems for codes and permutations

11 February 2014
14:30
Abstract

We give a new proof of the Frankl-Rödl theorem on set systems with a forbidden intersection. Our method extends to codes with forbidden distances, where over large alphabets our bound is significantly better than that obtained by Frankl and Rödl. One consequence of our result is a Frankl-Rödl type theorem for permutations with a forbidden distance. Joint work with Peter Keevash.

  • Combinatorial Theory Seminar