3 ms·
Is anyone else disturbed by the fact that the header image is incorrect? In that the distances between vertices are not all equal. See for example the blue node
by 21 9y ago
Is anyone else disturbed by the fact that the header image is incorrect? In that the distances between vertices are not all equal. See for example the blue node just beneath the outermost red node on the left side.
- bdcs 9y agoThe length between any two vertices which share an edge is 1 https://en.wikipedia.org/wiki/Unit_distance_graph https://en.wikipedia.org/wiki/Unit_distance_graph
- sowbug 9y agoIf you mean the blue node that's connected to the yellow node beneath it, I think it's actually connected to the yellow node beneath that one (the one that is distance 1 from the blue node :) ), and the edge happens to travel very close to the closer yellow node so that it looks like it intersects it. If those three nodes (blue, yellow, yellow) were in fact connected by short edges, then another problem would be that the two yellow nodes were connected, which they couldn't be by the constraints of the original problem.