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
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
@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},
     publisher = {mathdoc},
     volume = {62},
     number = {6},
     year = {2007},
     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 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/RM_2007_62_6_a15/ LA - en ID - RM_2007_62_6_a15 ER -
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/
