|
|
Problemy Peredachi Informatsii, 2015, Volume 51, Issue 2, Pages 86–98
(Mi ppi2172)
|
|
|
|
This article is cited in 7 scientific papers (total in 7 papers)
Large Systems
Independence numbers and chromatic numbers of some distance graphs
A. V. Bobu, O. A. Kostina, A. E. Kupriyanov Department of Mathematical Statistics and Random Processes, Faculty of Mathematics and Mechanics, Lomonosov Moscow State University, Moscow, Russia
Abstract:
We study a family of distance graphs in $\mathbb R^n$. We present bounds for independence numbers which are asymptotically tight as $n\to\infty$. We substantially improve upper bounds on chromatic numbers of these graphs, and in a number of cases we give explicit constructions of independence sets.
Received: 28.05.2014
Citation:
A. V. Bobu, O. A. Kostina, A. E. Kupriyanov, “Independence numbers and chromatic numbers of some distance graphs”, Probl. Peredachi Inf., 51:2 (2015), 86–98; Problems Inform. Transmission, 51:2 (2015), 165–176
Linking options:
https://www.mathnet.ru/eng/ppi2172 https://www.mathnet.ru/eng/ppi/v51/i2/p86
|
|