This article is cited in 5 papers

Brief Communications

New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in $\{-1,0,1\}^n$

V. F. Moskva^a, A. M. Raigorodskii<sup>b

a</sup> 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

DOI: 10.4213/mzm8940

 English version: Mathematical Notes, 2011, 89:2, 307–308

Bibliographic databases:

• 
• 
•