On Coloring the Odd-Distance Graph
Combinatorics
2009-08-12 v1
Abstract
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
Keywords
Cite
@article{arxiv.0908.1452,
title = {On Coloring the Odd-Distance Graph},
author = {Jacob Steinhardt},
journal= {arXiv preprint arXiv:0908.1452},
year = {2009}
}