Embeddings of graphs into Euclidean space under which the number of points that belong to a hyperplane is minimal
Journal Article
·
· Sbornik. Mathematics
- M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
The paper is devoted to the characteristic of a graph that is the minimal (over all embeddings of the graph into a space of given dimension) number of points that belong to the same hyperplane. Upper and lower estimates for this number are given that linearly depend on the dimension of the space. For trees a more precise upper estimate is obtained, which asymptotically coincides with the lower one for large dimension of the space. Bibliography: 9 titles.
- OSTI ID:
- 22094054
- Journal Information:
- Sbornik. Mathematics, Vol. 203, Issue 10; Other Information: Country of input: International Atomic Energy Agency (IAEA); ISSN 1064-5616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Obstructions to the realization of distance graphs with large chromatic numbers on spheres of small radii
Estimating the chromatic numbers of Euclidean space by convex minimization methods
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $\mathbb {R}^n$
Journal Article
·
Thu Oct 31 00:00:00 EDT 2013
· Sbornik. Mathematics
·
OSTI ID:22094054
Estimating the chromatic numbers of Euclidean space by convex minimization methods
Journal Article
·
Tue Jun 30 00:00:00 EDT 2009
· Sbornik. Mathematics
·
OSTI ID:22094054
+1 more
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in $\mathbb {R}^n$
Journal Article
·
Tue Oct 16 00:00:00 EDT 2018
· EURO Journal on Computational Optimization
·
OSTI ID:22094054
+2 more