Chromatic number of generalized Schrijver graphs
Carmen Arana

In 1978 Lovasz proved, using topological methods, that the graph denoted KG(n,k), whose vertices are subsets of size k of [n] with edges between disjoint sets, has chromatic number n-2k+2. Shortly after, Schrijver proposed vertex-critical induced subgraphs of such graphs, with the same chromatic number, by only taking independent sets of the n-cycle as vertices. We aim to study under what conditions a more general class of induced subgraphs of KG(n,k), obtained by considering independent sets of different graphs as vertices, has the same chromatic number as KG(n,k).