On the Chromatic Number of some generalized Kneser Graphs

Abstract

We determine the chromatic number of the Kneser graph q7,3,4 of flags of vectorial type 3, 4 of a rank 7 vector space over the finite field GF(q) for large q and describe the colorings that attain the bound. This result relies heavily, not only on the independence number, but also on the structure of all large independent sets. Furthermore, our proof is more general in the following sense: it provides the chromatic number of the Kneser graphs q2d+1,d,d+1 of flags of vectorial type d, d+1 of a rank 2d+1 vector space over GF(q) for large q as long as the large independent sets of the graphs are only the ones that are known.

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…