Independence numbers and chromatic numbers of some distance graphs

被引：0
|
作者：
A. V. Bobu
O. A. Kostina
A. E. Kupriyanov
机构：
[1] Lomonosov Moscow State University,Department of Mathematical Statistics and Random Processes, Faculty of Mathematics and Mechanics
来源：
Problems of Information Transmission | 2015年 / 51卷
关键词：
Information Transmission; Chromatic Number; Prime Power; Distance Graph; Intersection Theorem;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study a family of distance graphs in ℝn. We present bounds for independence numbers which are asymptotically tight as n → ∞. We substantially improve upper bounds on chromatic numbers of these graphs, and in a number of cases we give explicit constructions of independence sets.
引用
收藏
页码：165 / 176
页数：11
相关论文
共 50 条
12345