Intersecting Families of Separated Sets
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0211314,
title = {Intersecting Families of Separated Sets},
author = {John Talbot},
journal= {arXiv preprint arXiv:math/0211314},
year = {2007}
}
备注
21 pages. To appear in the Journal of the London Mathematical Society