Graph embeddings into Hamming spaces

Abstract: Graph embeddings deal with injective maps from a given simple, undirected graph $G=(V,E)$ into a metric space, such as $\mathbb{R}^n$ with the Euclidean metric. This concept is widely studied in computer science, see \cite{ge1}, but also offers attractive research in pure graph theory \cite{ge2}. In this note we show that any graph can be embedded into a particularly simple metric space: ${0,1}^n$ with the Hamming distance, for large enough $n$.