Intersecting Families of Separated Sets

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Combinatorics, 05D05;05C65

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/65726

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/math/0211314
 http://arxiv.org/abs/math/0211314

Collections

arXiv