Abstract:

A graph consists of a set of vertices and a set of edges connecting the vertices. Interestingly, two equivalent graphs can sit in 3-space in different ways. In other words, the two graphs are isomorphic, but there is no way to deform one of them through space to look like the other. In this talk, I will discuss some recent techniques researchers use to distinguish spatial graphs and study their complexities. Time permitting, I will also mention specific applications to the study of polymers.