Geodesic
On distance graphs with large chromatic number but without large simplices
Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 62 (2007) no. 6, pp. 1224-1225 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{RM_2007_62_6_a15,
     author = {A. M. Raigorodskii},
     title = {On distance graphs with large chromatic number but without large simplices},
     journal = {Trudy Matematicheskogo Instituta imeni V.A. Steklova},
     pages = {1224--1225},
     year = {2007},
     volume = {62},
     number = {6},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/RM_2007_62_6_a15/}
}
TY  - JOUR
AU  - A. M. Raigorodskii
TI  - On distance graphs with large chromatic number but without large simplices
JO  - Trudy Matematicheskogo Instituta imeni V.A. Steklova
PY  - 2007
SP  - 1224
EP  - 1225
VL  - 62
IS  - 6
UR  - http://geodesic.mathdoc.fr/item/RM_2007_62_6_a15/
LA  - en
ID  - RM_2007_62_6_a15
ER  - 
%0 Journal Article
%A A. M. Raigorodskii
%T On distance graphs with large chromatic number but without large simplices
%J Trudy Matematicheskogo Instituta imeni V.A. Steklova
%D 2007
%P 1224-1225
%V 62
%N 6
%U http://geodesic.mathdoc.fr/item/RM_2007_62_6_a15/
%G en
%F RM_2007_62_6_a15
A. M. Raigorodskii. On distance graphs with large chromatic number but without large simplices. Trudy Matematicheskogo Instituta imeni V.A. Steklova, Tome 62 (2007) no. 6, pp. 1224-1225. http://geodesic.mathdoc.fr/item/RM_2007_62_6_a15/

[1] A. Soifer, Matematicheskoe prosveschenie, tretya ser., no. 8, MTsNMO, M., 2004, 185–221

[2] A. M. Raigorodskii, Russian Math. Surveys, 56:1 (2001), 103–139 | DOI | MR | Zbl

[3] L. A. Székely, Paul Erdős and his mathematics, II (Budapest, 1999), Bolyai Soc. Math. Stud., 11, János Bolyai Math. Soc., Budapest, 2002, 649–666 | MR | Zbl

[4] F. Harary, Graph theory, Addison-Wesley, Reading, MA–Menlo Park, CA–London, 1969 | MR | MR | Zbl | Zbl

[5] N. G. de Bruijn, P. Erdős, Nederl. Akad. Wetensch. Proc. Ser. A, 54 (1951), 369–373 | MR | Zbl

[6] H. Hadwiger, Elem. Math., 16 (1961), 103–104

[7] A. M. Raigorodskii, Russian Math. Surveys, 55:2 (2000), 351–352 | DOI | MR | Zbl

[8] D. G. Larman, C. A. Rogers, Mathematika, 19 (1972), 1–24 | MR | Zbl

[9] P. O'Donnell, Geombinatorics, 4:1 (1994), 23–29 | MR | Zbl

[10] O'Donnell, Geombinatorics, 5:1 (1995), 31–34 | MR | Zbl

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

[12] N. Alon, J. H. Spencer, The probabilistic method, 2nd ed., Wiley-Intersci. Ser. Discrete Math. Optim., Wiley-Intersci., New York, 2000 | MR | Zbl

[13] B. Bollobás, Random graphs, 2nd ed., Cambridge Stud. Adv. Math., 73, Cambridge Univ. Press, Cambridge, 2001 | MR | Zbl