Embedding the n-cube in lower dimensions (Q581416): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Space graphs and sphericity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sphericity for the join of many graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5606305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5568974 / rank
 
Normal rank

Latest revision as of 11:32, 18 June 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
    0 references
    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

    Identifiers