Geodesic
Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth
Matematičeskie zametki, Tome 101 (2017) no. 3, pp. 430-445

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

We obtain some specific exponential lower bounds for the chromatic numbers of distance graphs with large girth.
Keywords: chromatic number, distance graph, Frankl–Rödl theorem. 
@article{MZM_2017_101_3_a9,
     author = {A. Sagdeev},
     title = {Lower {Bounds} for the {Chromatic} {Numbers} of {Distance} {Graphs} with {Large} {Girth}},
     journal = {Matemati\v{c}eskie zametki},
     pages = {430--445},
     publisher = {mathdoc},
     volume = {101},
     number = {3},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MZM_2017_101_3_a9/}
}
TY  - JOUR
AU  - A. Sagdeev
TI  - Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth
JO  - Matematičeskie zametki
PY  - 2017
SP  - 430
EP  - 445
VL  - 101
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MZM_2017_101_3_a9/
LA  - ru
ID  - MZM_2017_101_3_a9
ER  - 
%0 Journal Article
%A A. Sagdeev
%T Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth
%J Matematičeskie zametki
%D 2017
%P 430-445
%V 101
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MZM_2017_101_3_a9/
%G ru
%F MZM_2017_101_3_a9
A. Sagdeev. Lower Bounds for the Chromatic Numbers of Distance Graphs with Large Girth. Matematičeskie zametki, Tome 101 (2017) no. 3, pp. 430-445. http://geodesic.mathdoc.fr/item/MZM_2017_101_3_a9/