|
This article is cited in 5 scientific papers (total in 5 papers)
Brief Communications
New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in $\{-1,0,1\}^n$
V. F. Moskvaa, A. M. Raigorodskiib a Moscow Institute of Physics and Technology
b M. V. Lomonosov Moscow State University
Keywords:
distance graph, independence number, Borsuk problem, Nelson–Erdős–Hadwiger problem.
Received: 10.06.2010
Citation:
V. F. Moskva, A. M. Raigorodskii, “New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in $\{-1,0,1\}^n$”, Mat. Zametki, 89:2 (2011), 319–320; Math. Notes, 89:2 (2011), 307–308
Linking options:
https://www.mathnet.ru/eng/mzm8940https://doi.org/10.4213/mzm8940 https://www.mathnet.ru/eng/mzm/v89/i2/p319
|
Statistics & downloads: |
Abstract page: | 608 | Full-text PDF : | 223 | References: | 67 | First page: | 64 |
|