On combinatorial properties of spheres in euclidean spaces

DOI10.1007/BF02579146MaRDI QIDQ762171zbMATH OpenFDO

Authors Vojtěch Rödl

Publication date 1984

Published in Combinatorica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02579146

zbMATH Keywords

d-spherelambda-embedding of graphstriangle-free graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Review text

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.

Recommendations

• A combinatorial result about points and balls in Euclidean space
• scientific article; zbMATH DE number 176917
• On the chromatic numbers of spheres in Euclidean spaces
• On some problems of combinatorial geometry
• scientific article; zbMATH DE number 815758
• A combinatorial property of points and ellipsoids
• scientific article; zbMATH DE number 3929843
• Complements of sphere and subspace arrangements
• Enumeration in convex geometries and associated polytopal subdivisions of spheres
• scientific article; zbMATH DE number 5542490

Cites work

• A triangle free graph which cannot be 3 imbedded in any Euclidean unit sphere
• On embedding triangle-free graphs in unit spheres

Cited in

(5)

• A combinatorial result about points and balls in Euclidean space
• Geometrical embeddings of graphs
• 2-IRREDUCIBILITY OF SPATIAL GRAPHS
• Graphs with Large Girth Not Embeddable in the Sphere
• Comultiplications on a wedge of two spheres

This page was built for publication: On combinatorial properties of spheres in euclidean spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q762171)