On the chromatic number of \(q\)-Kneser graphs

DOI10.1007/s10623-011-9513-1zbMath1266.51008OpenAlexW2171798635MaRDI QIDQ690656

Andries E. Brouwer, Tamás Szőnyi, Aart Blokhuis

Publication date: 28 November 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9513-1

zbMATH Keywords

\(q\)-analogKneser graphchromatic number of a graph

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Extremal combinatorics (05D99)

Related Items (15)

Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space ⋮ A gap result for Cameron-Liebler \(k\)-classes ⋮ Remarks on the Erdős matching conjecture for vector spaces ⋮ The proportion of non-degenerate complementary subspaces in classical spaces ⋮ The unique coclique extension property for apartments of buildings ⋮ Treewidth of the \(q\)-Kneser graphs ⋮ On the chromatic number of some generalized Kneser graphs ⋮ Theorems of Erdős-Ko-Rado type in geometrical settings ⋮ The chromatic number of the \(q\)-Kneser graph for large \(q\) ⋮ Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring ⋮ The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces ⋮ Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\) ⋮ The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces ⋮ On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs ⋮ The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs

Cites Work

• Independent sets in association schemes
• A Hilton-Milner theorem for vector spaces
• The Erdős-Ko-Rado theorem for vector spaces
• Intersection theorems for systems of finite vector spaces
• Minimal covers of the Klein quadric

This page was built for publication: On the chromatic number of \(q\)-Kneser graphs