Flattenability in some -dimensional normed vector space is a property of graphs which states that any embedding, or drawing, of the graph in some high dimension can be "flattened" down to live in -dimensions, such that the distances between pairs of points connected by edges are preserved. A graph is -flattenable if every (DCS) with as its constraint graph has a -dimensional . Flattenability was first called realizability, but the name was changed to avoid confusion with a graph having some DCS with a -dimensional framework.