The Chromatic Number of the q-Kneser Graph for q ≥ 5
Abstract
We obtain a new weak Hilton-Milner type result for intersecting families of k-spaces in Fq2k, which improves several known results. In particular the chromatic number of the q-Kneser graph qKn:k was previously known for n > 2k (except for n=2k+1 and q=2) or k < q q - q. Our result determines the chromatic number of qK2k:k for q ≥ 5, so that the only remaining open cases are (n, k) = (2k, k) with q ∈ \ 2, 3, 4 \ and (n, k) = (2k+1, k) with q = 2.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.