电邮这篇文章 On chromatic numbers of nearly Kneser distance graphs
- 作者: Bobu A.V.1, Kupriyanov A.E.1, Raigorodskii A.M.1,2,3
-
隶属关系:
- Mechanics and Mathematics Faculty
- Moscow Institute of Physics and Technology (State University)
- Institute of Mathematics and Computer Science
- 期: 卷 93, 编号 3 (2016)
- 页面: 267-269
- 栏目: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/223694
- DOI: https://doi.org/10.1134/S1064562416030091
- ID: 223694
如何引用文章
开放存取
##reader.subscriptionAccessGranted##
订阅存取
详细
A family of distance graphs whose structure is close to that of Kneser graphs is studied. New lower and upper bounds for the chromatic numbers of such graphs are obtained, and relations between these numbers are considered. The structure of certain important independent sets of the family of graphs under consideration is described, and the cardinalities of these sets are explicitly calculated.
作者简介
A. Bobu
Mechanics and Mathematics Faculty
编辑信件的主要联系方式.
Email: a.v.bobu@gmail.com
俄罗斯联邦, Moscow, 119991
A. Kupriyanov
Mechanics and Mathematics Faculty
Email: a.v.bobu@gmail.com
俄罗斯联邦, Moscow, 119991
A. Raigorodskii
Mechanics and Mathematics Faculty; Moscow Institute of Physics and Technology (State University); Institute of Mathematics and Computer Science
Email: a.v.bobu@gmail.com
俄罗斯联邦, Moscow, 119991; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700; ul. Ranzhurova 5a, Ulan-Ude, 670000
补充文件
