Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4648867 | Discrete Mathematics | 2010 | 4 Pages |
Abstract
In this note, we investigate some properties of local Kneser graphs defined in [János Körner, Concetta Pilotto, Gábor Simonyi, Local chromatic number and sperner capacity, J. Combin. Theory Ser. B 95 (1) (2005) 101-117]. In this regard, as a generalization of the Erdös-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next, we provide an upper bound for their chromatic number.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani,