All Questions
2 questions
10
votes
1
answer
403
views
Are there non-trivial graphs that uniquely embed to hypercubes?
The $n$-dimensional hypercube is the graph formed by $0$-$1$ sequences of length $n$ where two vertices are adjacent if they differ at only one place.
The weight of a sequence is the number of $1$'s ...
- 19k
14
votes
0
answers
417
views
Monotone embedding of complete binary tree in hypercube
Embedding different graphs, especially binary trees, in the hypercube has a huge literature. However, I could not find anything if we restrict the embedding to be monotone. So I would like to ...
- 19k