Geodesic
On coloring the odd-distance graph
The electronic journal of combinatorics, Tome 16 (2009) no. 1

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl arXiv EuDML
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
DOI : 10.37236/250
Classification : 05C15, 05C12, 05C50 
Jacob Steinhardt. On coloring the odd-distance graph. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/250
@article{10_37236_250,
     author = {Jacob Steinhardt},
     title = {On coloring the odd-distance graph},
     journal = {The electronic journal of combinatorics},
     year = {2009},
     volume = {16},
     number = {1},
     doi = {10.37236/250},
     zbl = {1197.05060},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/250/}
}
TY  - JOUR
AU  - Jacob Steinhardt
TI  - On coloring the odd-distance graph
JO  - The electronic journal of combinatorics
PY  - 2009
VL  - 16
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/250/
DO  - 10.37236/250
ID  - 10_37236_250
ER  - 
%0 Journal Article
%A Jacob Steinhardt
%T On coloring the odd-distance graph
%J The electronic journal of combinatorics
%D 2009
%V 16
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/250/
%R 10.37236/250
%F 10_37236_250

Cité par Sources :