A Generalization of the Erd\"{o}s-Ko-Rado Theorem
classification
🧮 math.CO
keywords
generalizationgraphskneserlocals-ko-radotheoremboundcharacterize
read the original abstract
In 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.