User Tools

Site Tools


Maria Sloughter (Cornell)

Realizability of Graphs

Abstract for the Combinatorics Seminar 2004 October 11

A graph is d-realizable if, given a realization of the graph in some Euclidean space, there exists a realization in d-dimensional Euclidean space with the same edge lengths. For example, any tree is 1-realizable, but a triangle is not. In this talk, we will classify all 3-realizable graphs.

seminars/comb/abstract.200410slo.txt · Last modified: 2020/01/29 14:03 (external edit)