The chromatic number of $G$-stable Kneser graphs
Extending the notions of Kneser graphs and Schrijver graphs, we define the $G$-stable Kneser graph $KG(G,k)$ (where $k\geq 2$ and $G$ is a graph on $n\geq 2k$ vertices) as the graph whose vertices are the $k$-element independent sets in $G$ and whose edges join pairs of disjoint independent sets. The well-known result...