Geodesic
On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number
Matematičeskie zametki, Tome 96 (2014) no. 2, pp. 318-320.

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

Keywords: coloring problem, distance graph, chromatic number, random graph. 
@article{MZM_2014_96_2_a17,
     author = {A. A. Kokotkin},
     title = {On {Large} {Subgraphs} of a {Distance} {Graph} {Which} {Have} {Small} {Chromatic} {Number}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {318--320},
     publisher = {mathdoc},
     volume = {96},
     number = {2},
     year = {2014},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/}
}
TY  - JOUR
AU  - A. A. Kokotkin
TI  - On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number
JO  - Matematičeskie zametki
PY  - 2014
SP  - 318
EP  - 320
VL  - 96
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/
LA  - ru
ID  - MZM_2014_96_2_a17
ER  - 
%0 Journal Article
%A A. A. Kokotkin
%T On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number
%J Matematičeskie zametki
%D 2014
%P 318-320
%V 96
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/
%G ru
%F MZM_2014_96_2_a17
A. A. Kokotkin. On Large Subgraphs of a Distance Graph Which Have Small Chromatic Number. Matematičeskie zametki, Tome 96 (2014) no. 2, pp. 318-320. http://geodesic.mathdoc.fr/item/MZM_2014_96_2_a17/

[1] A. Soifer, The Mathematical Coloring Book. Mathematics of Coloring and the Colorful Life of its Creators, Springer, New York, 2009 | MR | Zbl

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

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

[4] A. M. Raigorodskii, “Coloring distance graphs and graphs of diameters”, Thirty Essays on Geometric Graph Theory, Springer-Verlag, Berlin, 2013, 429–460 | DOI | Zbl

[5] A. M. Raigorodskii, Matem. sb., 196:1 (2005), 123–156 | DOI | MR | Zbl

[6] A. M. Raigorodskii, Combinatorica, 32:1 (2012), 111–123 | DOI | MR | Zbl

[7] E. I. Ponomarenko, A. M. Raigorodskii, Dokl. RAN, 454:3 (2014), 268–269 | DOI

[8] O. Nechushtan, Discrete Math., 256:1-2 (2002), 499–507 | DOI | MR | Zbl

[9] D. Coulson, Discrete Math., 256 (2002), 83–90 | DOI | MR | Zbl

[10] A. M. Raigorodskii, UMN, 55:2 (2000), 147–148 | DOI | MR | Zbl

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

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

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

[14] B. Bollobás, Random Graphs, Cambridge Stud. Adv. Math., 73, Cambridge Univ. Press, Cambridge, 2001 | MR | Zbl