Highly Influential

We shall be interested in the following Erdős-Ko-Rado-type question. Fix some set B ⊂ [n]. How large a family A ⊂ P [n] can we find such that the intersection of any two sets in A contains a cyclic translate (modulo n) of B? Chung, Graham, Frankl and Shearer have proved that, in the case where B is a block of length t, we can do no better than to take A to… (More)

### Presentations referencing similar topics