0 like 0 dislike
0 like 0 dislike
Graph embeddings with edges of equal length

2 Answers

0 like 0 dislike
0 like 0 dislike
Look up “unit-distance graphs.” The discussion is about 2D by default, but higher dimensions are also considered. Determining whether a graph is unit-distance in n dimensions for any particular n > 1 is NP-hard.
0 like 0 dislike
0 like 0 dislike
1) I'm assuming by graph, you mean in the sense of graph theory?



2) We should restrict ourselves to some definitions. We know what an embedding in 2D euclidean space would be as we have the definition of planarity to restrict ourselves to. What constitutes a valid embedding in 3D euclidean space in the first place?

Related questions

0 like 0 dislike
0 like 0 dislike
61 answers
_spunkki asked Jun 21
Just ordered a Klein Bottle from Cliff Stoll. He sent me about 2 dozen pictures of him packing it up. Why is he so cute :)
_spunkki asked Jun 21
0 like 0 dislike
0 like 0 dislike
5 answers
BrianDenver7 asked Jun 21
Is there a nice way to recast riemannian geometry in terms of principal bundles?
BrianDenver7 asked Jun 21
0 like 0 dislike
0 like 0 dislike
47 answers
countykathleen asked Jun 21
Is it possible to suck at rigor of math but great at intuition?
countykathleen asked Jun 21
0 like 0 dislike
0 like 0 dislike
3 answers
daedaePIVOT asked Jun 21
Cofactor Matrix of Cofactor Matrix
daedaePIVOT asked Jun 21
0 like 0 dislike
0 like 0 dislike
3 answers
jc_coleman4 asked Jun 21
Examples of distributions
jc_coleman4 asked Jun 21

24.8k questions

103k answers

0 comments

33.7k users

OhhAskMe is a math solving hub where high school and university students ask and answer loads of math questions, discuss the latest in math, and share their knowledge. It’s 100% free!