Families intersecting on an interval
| dc.creator | Russell, Paul A. | |
| dc.date | 2007-10-09 | |
| dc.date.accessioned | 2026-07-07T08:35:05Z | |
| dc.date.available | 2026-07-07T08:35:05Z | |
| dc.description | We shall be interested in the following Erdos-Ko-Rado-type question. Fix some subset B of [n]. How large a family A of subsets of [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 consist of all supersets of B. We give an alternative proof of this result, which is in a certain sense more 'direct'. | |
| dc.description | 7 pages | |
| dc.identifier | https://arxiv.org/abs/0710.1797 | |
| dc.identifier | http://arxiv.org/abs/0710.1797 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139647 | |
| dc.subject | Combinatorics | |
| dc.subject | 05D05 | |
| dc.title | Families intersecting on an interval | |
| dc.type | text |