On coloring the odd-distance graph (Q1028805)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On coloring the odd-distance graph
scientific article

    Statements

    On coloring the odd-distance graph (English)
    0 references
    0 references
    8 July 2009
    0 references
    Summary: We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references