On chromatic numbers of close-to-Kneser distance graphs
On chromatic numbers of close-to-Kneser distance graphs
复制标题
关于近克纳泽距离图的色数
DOI：
10.1134/s0032946016040050
复制
发表时间：
2016
影响因子：
1.2
通讯作者：
A. Kupriyanov
中科院分区：
文献类型：
--
作者：
A. Bobu;A. Kupriyanov
本文研究了一类距离图，它的结构与Kneser图的结构很接近。我们给新的下限和上限的色数这样的图，并考虑它们之间的相互关系的问题。我们还描述了一些重要的独立集的结构，这个家庭的图，并明确计算其基数。
We study a family of distance graphs whose structure is close to that of Kneser graphs. We give new lower and upper bounds on the chromatic numbers of such graphs and consider the question of their interrelation. We also describe the structure of some important independence sets for this family of graphs and explicitly compute their cardinalities.