Graph embeddings into Hamming spaces

01/10/2019

∙

by   Dominic van der Zypen, et al.

∙

0

∙

share

Graph embeddings deal with injective maps from a given simple, undirected graph G=(V,E) into a metric space, such as R^n with the Euclidean metric. This concept is widely studied in computer science, see ge1, but also offers attractive research in pure graph theory 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.