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

Abstract

Let be the graph whose vertices are the chambers of the finite projective 3-space PG(3,q), 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 q4+3q3+4q2+3q+1, or 3q3+5q2+3q+1, or at most 3q3+4q2+3q+2 elements. For q≥ 4 the structure of the largest maximal independent sets is described. For q≥ 7 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 q2+q.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…