On chromatic numbers of some distance graphs
Combinatorics
2016-08-08 v1
Abstract
In this paper we find chromatic numbers of distance graphs for infinitely many n. Also we improve upper bound for in large part of cases.
Cite
@article{arxiv.1608.01873,
title = {On chromatic numbers of some distance graphs},
author = {D. Zakharov},
journal= {arXiv preprint arXiv:1608.01873},
year = {2016}
}
Comments
9 pages, in Russian