On the chromatic number of q-Kneser graphs

被引：0
|
作者：
A. Blokhuis
A. E. Brouwer
T. Szőnyi
机构：
[1] Eindhoven University of Technology,Dept. of Mathematics
[2] Eötvös Loránd University,Institute of Mathematics
[3] Hungarian Academy of Sciences,Computer and Automation Research Institute
来源：
Designs, Codes and Cryptography | 2012年 / 65卷
关键词：
Chromatic number; -analog of Kneser graph; 51E20; 05B25; 05D99;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We show that the q-Kneser graph qK2k: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 qk + qk−1 for k = 3 and for k < q log q − q. We obtain detailed results on maximal cocliques for k = 3.
引用
收藏
页码：187 / 197
页数：10
相关论文
共 50 条
12345