Intersecting Families of Separated Sets

Simple item page
dc.creatorTalbot, John
dc.date2002-11-20
dc.date.accessioned2026-07-07T04:53:07Z
dc.date.available2026-07-07T04:53:07Z
dc.descriptionWe 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.
dc.description21 pages. To appear in the Journal of the London Mathematical Society
dc.identifierhttps://arxiv.org/abs/math/0211314
dc.identifierhttp://arxiv.org/abs/math/0211314
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/65726
dc.subjectCombinatorics
dc.subject05D05;05C65
dc.titleIntersecting Families of Separated Sets
dc.typetext

Files

Collections

arXiv