On the chromatic number of rational five-space (Q917571): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Jozef Fiamčik / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Jozef Fiamčik / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4014311 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Unit-distance graphs in rational n-spaces / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:04, 21 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the chromatic number of rational five-space |
scientific article |
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
