On the chromatic number of rational five-space (Q917571)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4156469
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the chromatic number of rational five-space |
scientific article; zbMATH DE number 4156469 |
Statements
On the chromatic number of rational five-space (English)
0 references
1990
0 references
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.
0 references
rational points
0 references
chromatic number
0 references
clique number
0 references
0.9438139200210572
0 references
0.9202851057052612
0 references
0.8856185078620911
0 references
