On Coloring the Odd-Distance Graph

  • Jacob Steinhardt

Abstract

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

Published
2009-04-30
Article Number
N12