Finding knots in graph embeddings
A while ago I wrote a post about indistinguishable sceneries on the Boolean hypercube. The post contained this (pretty, if I may so myself) image: This is a three dimensional embedding of the four dimensional Boolean hypercube; by “embedding”, I mean putting the vertices and edges of the 4d cube in some way in space, … More Finding knots in graph embeddings