The intrinsic dimensionality of graphs

We resolve the following conjecture raised by Levin together with Linial, London, and Rabinovich [Combinatorica, 1995]. For a graph G, let dim(G) be the smallest d such that G occurs as a (not necessarily induced) subgraph of Zd , the infinite graph with vertex set Zd and an

• Type: Conference
• Year: 2003
• Where: STOC
• Authors: Robert Krauthgamer, James R. Lee
• Keywords: Algorithms, STOC 2003, Vertex Set Zd