On the chromatic number of q-Kneser graphs
From MaRDI portal
Publication:690656
DOI10.1007/S10623-011-9513-1zbMATH Open1266.51008OpenAlexW2171798635MaRDI QIDQ690656FDOQ690656
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
Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Extremal combinatorics (05D99)
Cites Work
Cited In (22)
- Erdős-Ko-Rado theorem, Grassmann graphs and \(p^s\)-Kneser graphs for vector spaces over a residue class ring
- A Kruskal-Katona-type theorem for graphs: \(q\)-Kneser graphs
- The chromatic number of the \(q\)-Kneser graph for large \(q\)
- The kernel of chromatic quasisymmetric functions on graphs and nestohedra
- The largest Erdős-Ko-Rado sets in \(2-(v,k,1)\) designs
- On the quantum chromatic number of a graph
- Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space
- The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces
- Theorems of Erdős-Ko-Rado type in geometrical settings
- The proportion of non-degenerate complementary subspaces in classical spaces
- Remarks on the Erdős matching conjecture for vector spaces
- The unique coclique extension property for apartments of buildings
- On the \(P_3\)-hull numbers of \(q\)-Kneser graphs and Grassmann graphs
- Treewidth of the \(q\)-Kneser graphs
- On the chromatic number of some generalized Kneser graphs
- The chromatic number of two families of generalized Kneser graphs related to finite generalized quadrangles and finite projective 3-spaces
- A gap result for Cameron-Liebler \(k\)-classes
- Maximal cocliques in the Kneser graph on point-plane flags in \(\mathrm{PG}(4,q)\)
- On the chromatic number of a subgraph of the Kneser graph
- On the chromatic number of Kneser hypergraphs
- A new approach to the chromatic number of the square of Kneser graph \(K(2k+1,k)\)
- On the upper and lower chromatic numbers of BSQSs(16)
This page was built for publication: On the chromatic number of \(q\)-Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690656)