Enviar artigo por via de e-mail On chromatic numbers of nearly Kneser distance graphs
- Autores: Bobu A.V.1, Kupriyanov A.E.1, Raigorodskii A.M.1,2,3
-
Afiliações:
- Mechanics and Mathematics Faculty
- Moscow Institute of Physics and Technology (State University)
- Institute of Mathematics and Computer Science
- Edição: Volume 93, Nº 3 (2016)
- Páginas: 267-269
- Seção: Mathematics
- URL: https://journals.rcsi.science/1064-5624/article/view/223694
- DOI: https://doi.org/10.1134/S1064562416030091
- ID: 223694
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
A. Bobu
Mechanics and Mathematics Faculty
Autor responsável pela correspondência
Email: a.v.bobu@gmail.com
Rússia, Moscow, 119991
A. Kupriyanov
Mechanics and Mathematics Faculty
Email: a.v.bobu@gmail.com
Rússia, 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
Rússia, Moscow, 119991; Institutskii per. 9, Dolgoprudnyi, Moscow oblast, 141700; ul. Ranzhurova 5a, Ulan-Ude, 670000
Arquivos suplementares
