On the chromatic number of q-Kneser graphs

被引：18
|
作者：
Blokhuis, A. [1 ]
Brouwer, A. E. [1 ]
Szonyi, T. [2 ,3 ]
机构：
[1] Eindhoven Univ Technol, Dept Math, NL-5600 MB Eindhoven, Netherlands
[2] Eotvos Lorand Univ, Inst Math, H-1117 Budapest, Hungary
[3] Hungarian Acad Sci, Comp & Automat Res Inst, H-1111 Budapest, Hungary
来源：
DESIGNS CODES AND CRYPTOGRAPHY | 2012年 / 65卷 / 03期
关键词：
Chromatic number; q-analog of Kneser graph; VECTOR-SPACES; THEOREM;
D O I：
10.1007/s10623-011-9513-1
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We show that the q-Kneser graph qK(2k:k) (the graph on the k-subspaces of a 2k-space over GF(q), where two k-spaces are adjacent when they intersect trivially), has chromatic number q(k) + q(k-1) for k = 3 and for k < q log q - q. We obtain detailed results on maximal cocliques for k = 3.
引用
收藏
页码：187 / 197
页数：11
相关论文
共 50 条
12345