On combinatorial properties of spheres in euclidean spaces (Q762171): Difference between revisions

A graph G is said to be \(\lambda\)-imbedded into some space if two vertices of the imbedding are joined by an edge iff their distance is \(>\lambda\). In the paper it is proved: For every \(2>\lambda >\sqrt{2}\) there exists a triangle-free graph G that cannot be \(\lambda\)-imbedded into the d-sphere for any positive integer d.