New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in~$\{-1,0,1\}^n$
Matematičeskie zametki, Tome 89 (2011) no. 2, pp. 319-320.

Voir la notice de l'article provenant de la source Math-Net.Ru

Keywords: distance graph, independence number, Borsuk problem, Nelson–Erdős–Hadwiger problem.
@article{MZM_2011_89_2_a13,
     author = {V. F. Moskva and A. M. Raigorodskii},
     title = {New {Lower} {Bounds} for the {Independence} {Numbers} of {Distance} {Graphs} with {Vertices} in~$\{-1,0,1\}^n$},
     journal = {Matemati\v{c}eskie zametki},
     pages = {319--320},
     publisher = {mathdoc},
     volume = {89},
     number = {2},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2011_89_2_a13/}
}
TY  - JOUR
AU  - V. F. Moskva
AU  - A. M. Raigorodskii
TI  - New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in~$\{-1,0,1\}^n$
JO  - Matematičeskie zametki
PY  - 2011
SP  - 319
EP  - 320
VL  - 89
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2011_89_2_a13/
LA  - ru
ID  - MZM_2011_89_2_a13
ER  - 
%0 Journal Article
%A V. F. Moskva
%A A. M. Raigorodskii
%T New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in~$\{-1,0,1\}^n$
%J Matematičeskie zametki
%D 2011
%P 319-320
%V 89
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2011_89_2_a13/
%G ru
%F MZM_2011_89_2_a13
V. F. Moskva; A. M. Raigorodskii. New Lower Bounds for the Independence Numbers of Distance Graphs with Vertices in~$\{-1,0,1\}^n$. Matematičeskie zametki, Tome 89 (2011) no. 2, pp. 319-320. http://geodesic.mathdoc.fr/item/MZM_2011_89_2_a13/

[1] A. M. Raigorodskii, UMN, 56:1 (2001), 107–146 | MR | Zbl

[2] A. M. Raigorodskii, Lineino-algebraicheskii metod v kombinatorike, MTsNMO, M., 2007

[3] A. M. Raigorodskii, Surveys in Contemporary Mathematics, London Math. Soc. Lecture Note Ser., 347, Cambridge Univ. Press, Cambridge, 2008, 202–247 | MR | Zbl

[4] V. G. Boltyanskii, I. Ts. Gokhberg, Teoremy i zadachi kombinatornoi geometrii, Nauka, M., 1965 | MR | Zbl

[5] V. G. Boltyanski, H. Martini, P. S. Soltan, Excursions into Combinatorial Geometry, Universitext, Springer, Berlin, 1997 | MR | Zbl

[6] P. Brass, W. Moser, J. Pach, Research Problems in Discrete Geometry, Springer, New York, 2005 | MR | Zbl

[7] V. K. Lyubimov, A. M. Raigorodskii, Dokl. RAN, 427:4 (2009), 458–460 | MR | Zbl

[8] A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, A. S. Usachev, “O chislakh nezavisimosti grafov rasstoyanii s vershinami v $\{-1,0,1\}^n$: otsenki, gipotezy i prilozheniya k zadacham Borsuka i Nelsona–Erdesha–Khadvigera”, Itogi nauki i tekhn. Ser. Sovrem. mat. i ee pril. Temat. obz. (to appear)

[9] A. E. Guterman, V. K. Lyubimov, A. M. Raigorodskii, A. S. Usachev, Matem. zametki, 86:5 (2009), 794–796 | MR | Zbl