On the chromatic number of rational five-space. (English) Zbl 0705.05034
Let \(Q^ 5\) denote the collection of all the rational points in \(E^ 5\) and let \(G(Q^ 5)\) denote the graph obtained by taking \(Q^ 5\) as its vertex set and connecting 2 points iff they are at a distance 1. There is shown that the graph \(G(Q^ 5)\) has chromatic number at least 6 and clique number 4.
Reviewer: J.Fiamčík
References:
| [1] | Zaks, J.,On the chromatic number of some rational spaces (preprint). · Zbl 0766.05032 |
| [2] | Chilakamarri, K. B.,Unit-distance graphs in rational n-space. Discrete Math.69 (1988), 213–218. · Zbl 0642.05047 · doi:10.1016/0012-365X(88)90049-0 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
