Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal

DOI10.1070/SM2012V203N10ABEH004273MaRDI QIDQ4907598zbMATH OpenFDO

Authors K. I. Oblakov, T. A. Oblakova

Publication date 4 February 2013

Published in Sbornik: Mathematics (Search for Journal in Brave)

zbMATH Keywords

graph embeddingshyperplane

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15)

Recommendations

• Embedding graphs in Euclidean space
• Embedding graphs in Euclidean space
• Embeddings of graphs in Euclidean spaces
• The dimension of a graph
• Special embeddings of some disconnected graphs into Euclidean space

Cited in

(9)

• scientific article; zbMATH DE number 1045540 (Why is no real title available?)
• Finite Transitive Graph Embeddings into a Hyperbolic Metric Space Must Stretch or Squeeze
• Sums of distances on graphs and embeddings into Euclidean space
• Special embeddings of some disconnected graphs into Euclidean space
• NOTE ON THE EUCLIDEAN EMBEDDINGS
• Graph varieties in high dimension
• Realization of graphs in the space of bounded height
• Graphs embedded in the plane with a bounded number of accumulation points
• On embedding of graphs into Euclidean spaces of small dimension

This page was built for publication: Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal

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