Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG(3,q) $(3,q)$

Abstract

Let be the graph whose vertices are the chambers of the finite projective 3‐space , with two vertices being adjacent if and only if the corresponding chambers are in general position. We show that a maximal independent set of vertices of contains , or , or at most elements. For the structure of the largest maximal independent sets is described. For the structure of the maximal independent sets of the three largest cardinalities is described. Using the cardinality of the second largest maximal independent sets, we show that the chromatic number of is .