John Talbot
Published 2002-11-20Version 1
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.
Comments: 21 pages. To appear in the Journal of the London Mathematical Society
Transference for the Erdős-Ko-Rado theorem
Independence and Matchings in $σ$-hypergraphs
On the stability of the Erdős-Ko-Rado theorem
![QR code for arXiv:math/0211314 [math.CO]](http://oss.arxitics.com/images/favicon.svg)