Intersecting Families of Separated Sets

Abstract

We prove a conjecture due to Holroyd and Johnson that an analogue of the Erdos-Ko-Rado theorem holds for k-separated sets. In particular this determines the independence number of the vertex-critical subgraph of the Kneser graph identified by Schrijver, the collection of separated sets.

21 pages. To appear in the Journal of the London Mathematical Society