On the chromatic number of some generalized Kneser graphs

Abstract

AbstractWe determine the chromatic number of the Kneser graph of flags of vectorial type of a rank 7 vector space over the finite field for large and describe the colorings that attain the bound. This result relies heavily, not only on the independence number, but also on the structure of alllargeindependent sets. Furthermore, our proof is more general in the following sense: it provides the chromatic number of the Kneser graphs of flags of vectorial type of a rank vector space over for large as long as thelargeindependent sets of the graphs are only the ones that are known.