Embedding the n-cube in lower dimensions (Q581416): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 00:42, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Embedding the n-cube in lower dimensions |
scientific article |
Statements
Embedding the n-cube in lower dimensions (English)
0 references
1986
0 references
The sphericity of a graph G, sph(G), is the smallest integer m such that G is embeddable into the Euclidean space \(E^ m\) in a way that adjacent vertices have distance at most 1 while any two non-adjacent vertices are at distance more than 1. It is proved that for the n-dimensional cube \(Q_ n\) it holds \[ (1+o(1))n/\log_ 2n<sph(Q_ n)<(2\quad \log_ 23+o(1))n/\log_ 2n. \]
0 references
sphericity of a graph
0 references
n-dimensional cube
0 references