Hacker News new | past | comments | ask | show | jobs | submit login

Oh geez, yeah I misread that totally! thanks.

A graph is d-realizable if given any realization of the graph in n dimensions (possibly high dimensional), there exists a realization in d dimensions with the same edge lengths.

(I thought 'n dimensions' looked clearer than RR^n, though less accurate I guess)

Guidelines | FAQ | Support | API | Security | Lists | Bookmarklet | Legal | Apply to YC | Contact