Connectivity of distance graphs (Q1196753)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connectivity of distance graphs |
scientific article |
Statements
Connectivity of distance graphs (English)
0 references
16 January 1993
0 references
Let \(K\supseteq\mathbb{Q}\) be a \(\mathbb{Z}\)-module and \(G\) a graph with a \(K\)- space as vertex set \(V\). If the edges of \(G\) are preserved under translations in \(V\) and \(G\) has more than one connected component, then the author shows that \(G\) has infinitely many components.
0 references
connectivity
0 references
distance graphs
0 references
chromatic number
0 references
