On Coloring the Odd-Distance Graph

  • Jacob Steinhardt
DOI: https://doi.org/10.37236/250

Abstract

We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.

Published
2009-04-30
How to Cite
Steinhardt, J. (2009). On Coloring the Odd-Distance Graph. The Electronic Journal of Combinatorics, 16(1), N12. https://doi.org/10.37236/250
Issue
Volume 16, Issue 1 (2009)
Article Number
N12