A Generalization of the Erdös-Ko-Rado Theorem

Simple item page
dc.creatorAlishahi, Meysam
dc.creatorHajiabolhassan, Hossein
dc.creatorTaherkhani, Ali
dc.date2009-02-22
dc.date.accessioned2026-07-07T12:45:30Z
dc.date.available2026-07-07T12:45:30Z
dc.descriptionIn this note, we investigate some properties of local Kneser graphs defined in [8]. In this regard, as a generalization of the Erd${\rm \ddot{o}}$s-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next, we present an upper bound for their chromatic number.
dc.identifierhttps://arxiv.org/abs/0902.3770
dc.identifierhttp://arxiv.org/abs/0902.3770
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/221103
dc.subjectCombinatorics
dc.titleA Generalization of the Erdös-Ko-Rado Theorem
dc.typetext

Files

Collections

arXiv