A 6-chromatic odd-distance graph in the plane
Combinatorics
2022-06-28 v1
Abstract
Two vertices of an odd-distance graph are connected by an edge if and only if their Euclidean distance is an odd integer. We construct a 6-chromatic odd-distance graph in the plane.
Keywords
Cite
@article{arxiv.2206.12632,
title = {A 6-chromatic odd-distance graph in the plane},
author = {Jaan Parts},
journal= {arXiv preprint arXiv:2206.12632},
year = {2022}
}